Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | State-space search algorithm that uses heuristic information only to choose the most promising node to expand next, instead of doing the expansions in a strictly breadth-first or depth-first order. Source: European Union. (references) |
Math | A search algorithm that considers the estimated best partial solution next. This is typically implemented with a priority queue. (references) |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
Efficient selection of the current best candidate for extension is typically implemented using a priority queue.
Examples of best-first search algorithms include Dijkstra's algorithm and the A-star search algorithm. Best-first algorithms are often used for pathfinding in combinatorial search.
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Best-first search."
Crosswords: BEST-FIRST SEARCH |
| Specialty definitions using "BEST-FIRST SEARCH": A* algorithm, A-star algorithm. (references) |
| Language | Translations for "BEST-FIRST SEARCH"; alternative meanings/domain in parentheses. | ||||||||||||||||
Danish | bedst-først søgning (ordered search), ordnet søgning (ordered search). (various references) | ||||||||||||||||
Dutch | best-first zoekproces (ordered search), geordend zoekproces (ordered search). (various references) | ||||||||||||||||
Finnish | paras ensin-haku (ordered search), järjestetty haku (ordered search). (various references) | ||||||||||||||||
French | recherche ordonnée, recherche meilleur-d'abord, recherche du meilleur-premier. (various references) | ||||||||||||||||
German | geordnete Suche (ordered search). (various references) | ||||||||||||||||
Greek | διερεύνηση με τη βέλτιστη επιλογή (ordered search), διατεταγμένη διερεύνηση (ordered search). (various references) | ||||||||||||||||
Italian | ricerca lungo il cammino migliore (ordered search). (various references) | ||||||||||||||||
Pig Latin | est-firstbay earchsay procura do melhor em primeiro lugar (ordered search). (various references) búsqueda primero-lo-mejor (ordered search), búsqueda ordenada (ordered search). (various references) | ||||||||||||||||
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-b-c-e-e-f-h-i-r-r-s-s-s-t-t" | |
-3 letters: researchists. | |
-4 letters: afterbirths, researchist, tetrarchies, traitresses. | |
-5 letters: aesthetics, afterbirth, birthrates, brasseries, brassieres, breathiest, briefcases, careerists, chastisers, chatterers, earthrises, fricassees, hesitaters, restitches, scatterers, starchiest, starfishes, streetcars, stretchers, stretchier, tesseracts. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)42 45 53 54 2D 46 49 52 53 54      53 45 41 52 43 48 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000010 01000101 01010011 01010100 00101101 01000110 01001001 01010010 01010011 01010100 00100000 01010011 01000101 01000001 01010010 01000011 01001000 |
HTML Code (1990) (references)B E S T - F I R S T   S E A R C H |
ISO 10646 (1991-1993) (references)0042 0045 0053 0054 002D 0046 0049 0052 0053 0054      0053 0045 0041 0052 0043 0048 |
Encryption (beginner's substitution cypher): (references)363953541540435253542533935523742 |
| 1. Crosswords 2. Translations: Modern 3. Anagrams 4. Orthography | 5. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.