User:Varkora/sandbox/Recursive best-first search
 | This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft. Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
| Class | Search algorithm |
|---|---|
| Data structure | Graph |
| Worst-case space complexity |
Recursive best-first search is a graph traversal and path search algorithm that can find the shortest path between a designated start node and any member of a set of goal nodes in a weighted graph.[1]
Pseudocode[edit]
References[edit]
- ^ Artificial Intelligence: A Modern Approach. ISBN 0-13-604259-7.
Category:Graph algorithms Category:Routing algorithms Category:Search algorithms Category:Game artificial intelligence