User:Varkora/sandbox/Recursive best-first search

Class	Search algorithm
Data structure	Graph
Worst-case space complexity

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
Easy tools: Citation bot (help) | Advanced: Fix bare URLs
This page was last edited by Plastikspork (talk | contribs) 17 months ago. (Update timer)

Finished writing a draft article? Are you ready to request an experienced editor review it for possible inclusion in Wikipedia? Submit your draft for review!

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

References

^ Artificial Intelligence: A Modern Approach. ISBN 0-13-604259-7.

Category:Graph algorithms Category:Routing algorithms Category:Search algorithms Category:Game artificial intelligence

[1] Artificial Intelligence: A Modern Approach. ISBN 0-13-604259-7.

[1]

v t e Graph and tree traversal algorithms
Search	α–β pruning A* IDA* LPA* SMA* Best-first search Beam search Bidirectional search Breadth-first search Lexicographic Parallel B* Depth-first search Iterative deepening D* Fringe search Jump point search Monte Carlo tree search SSS*
Shortest path	Bellman–Ford Dijkstra's Floyd–Warshall Johnson's Shortest path faster Yen's
Minimum spanning tree	Borůvka's Kruskal's Prim's Reverse-delete
List of graph search algorithms