Content deleted Content added
→Proposed merge with Uniform-cost search: Support merge |
→Proposed merge with Uniform-cost search: best-first |
||
Line 86:
:It's funny—in the paper ''Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment'' which you linked to they refer to Dijkstra's algorithm as a [[best-first search]]. I thought a best-first search was a kind of informed search, i.e. a search that is equipped with a [[Heuristic (computer science)|heuristic]], but looking in Russell and Norvig, it seems that this is not necessarily true either (although it is in most cases). It seems that it is very easy to have preconceptions when it comes to terminology of different algorithms. —[[User:Kri|Kri]] ([[User talk:Kri|talk]]) 13:54, 7 November 2014 (UTC)
::Indeed, and in the context of [[branch and bound]], "best-first" also means guided by a cost estimate heuristic (see, e.g., [http://www.diku.dk/OLD/undervisning/2003e/datV-optimer/JensClausenNoter.pdf Clausen]). I've never seen Dijkstra's being called that before. [[User:Qwertyus|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus|hm?]])</small> 14:24, 7 November 2014 (UTC)
| |||