Best-first search
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. Judea Pearl described best-first search as estimating the promise of node n by a "heuristic evaluation function which, in general, may depend on the description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain." Efficient selection of the current best candidate for extension is typically implemented using a priority queue.
Wikipage disambiguates
Wikipage redirect
A* search algorithmAlpha–beta pruningB*BFSBeam searchBest first searchBranch and boundDijkstra's algorithmFeature selectionGreedy algorithmGreedy best-first searchGuillotine cuttingHeuristic (computer science)Hill climbingID3 algorithmIsaPlannerList of algorithmsList of graph theory topicsList of terms relating to algorithms and data structuresMonotone priority queuePriority queuePure heuristic searchSLD resolutionSSS*Search algorithmState space search
Link from a Wikipage to another Wikipage
primaryTopic
Best-first search
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. Judea Pearl described best-first search as estimating the promise of node n by a "heuristic evaluation function which, in general, may depend on the description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain." Efficient selection of the current best candidate for extension is typically implemented using a priority queue.
has abstract
Best-first search (letteralmen ...... luzione ottimale del problema.
@it
Best-first search is a search ...... timated distances to the goal.
@en
La recherche best-first (litté ...... en optimisation combinatoire.
@fr
O algoritmo de busca melhor-pr ...... a é escolhido para a expansão.
@pt
Uspořádané prohledávání (angli ...... ientního prohledávání o paměť.
@cs
По́шук «Найкра́щий — пе́рший» ...... овідно до визначеного правила.
@uk
Поиск «лучший — первый» (англ. ...... а пути в комбинаторном поиске.
@ru
أفضل-البحث الأول هو خوارزمية ب ...... زمية البحث الأول-الأفضل الجشع.
@ar
最良優先探索(さいりょうゆうせんたんさく、英: best-f ...... ュータチェスなどでも最良優先探索を拡張した物が使われている。
@ja
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
999,941,849
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Best-first search (letteralmen ...... ati del problema da risolvere.
@it
Best-first search is a search ...... mented using a priority queue.
@en
La recherche best-first (litté ...... ntaires à propos du problème".
@fr
O algoritmo de busca melhor-pr ...... a é escolhido para a expansão.
@pt
Uspořádané prohledávání (angli ...... dávání vrcholů opírá vstupní d
@cs
По́шук «Найкра́щий — пе́рший» ...... овідно до визначеного правила.
@uk
Поиск «лучший — первый» (англ. ...... знаний о предметной области».
@ru
أفضل-البحث الأول هو خوارزمية ب ...... بور الأولوية (priority queue).
@ar
最良優先探索(さいりょうゆうせんたんさく、英: best-f ...... ュータチェスなどでも最良優先探索を拡張した物が使われている。
@ja
label
Algorithme de recherche best-first
@fr
Best-first Search
@pt
Best-first search
@en
Best-first search
@it
Bestensuche
@de
Uspořádané prohledávání
@cs
Поиск по первому наилучшему совпадению
@ru
Пошук за першим найкращим збігом
@uk
بحث أول-أفضل
@ar
最良優先探索
@ja