best-first search

Summary

best-first search is a graph algorithm^[1]. It draws 48 Wikipedia views per month (graph_algorithm category, ranking #4 of 12).^[2]

Key Facts

• best-first search's instance of is recorded as graph algorithm^[3].
• best-first search's instance of is recorded as informed search algorithm^[4].
• best-first search's Freebase ID is recorded as /m/012_wm^[5].
• best-first search's described by source is recorded as Artificial Intelligence: A Modern Approach^[6].
• best-first search's Dictionary of Algorithms and Data Structures ID is recorded as bestfirst^[7].
• best-first search's Microsoft Academic ID is recorded as 46011968^[8].
• best-first search's De Agostini ID is recorded as best-first+search^[9].
• best-first search's OpenAlex ID is recorded as C46011968^[10].

Body

Designation and Status

Recorded instance of include graph algorithm^[3] and informed search algorithm^[4].

Cultural Significance

Things named for best-first search include recursive it^[11], an informed search algorithm^[12].

Why It Matters

best-first search draws 48 Wikipedia views per month (graph_algorithm category, ranking #4 of 12).^[2] It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.^[13] It is known by 17 alternative names across languages and contexts.^[14]

Entities named for it include recursive it^[11], an informed search algorithm^[12].