recursive best-first search

Summary

recursive best-first search is an informed search algorithm^[1]. It is known by 3 alternative names across languages and contexts.^[2]

Key Facts

• recursive best-first search is credited with the discovery of Richard E. Korf^[3].
• recursive best-first search's instance of is recorded as informed search algorithm^[4].
• recursive best-first search's instance of is recorded as pathfinding algorithm^[5].
• best-first search is named after recursive best-first search^[6].
• recursive best-first search's subclass of is recorded as A* search algorithm^[7].
• recursive best-first search's time of discovery or invention is recorded as +1992-00-00T00:00:00Z^[8].
• recursive best-first search's described by source is recorded as Artificial Intelligence: A Modern Approach^[9].
• recursive best-first search's described by source is recorded as Linear-space best-first search^[10].
• recursive best-first search's described by source is recorded as Linear-Space Best-First Search: Summary of Results^[11].
• recursive best-first search's Google Knowledge Graph ID is recorded as /g/15dpdkpg^[12].

Body

Designation and Status

Recorded instance of include informed search algorithm^[4] and pathfinding algorithm^[5].

History and Context

best-first search is named after recursive best-first search^[6].

Why It Matters

recursive best-first search is known by 3 alternative names across languages and contexts.^[2]