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 WOSlinker (talk | contribs) 8 years 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!

Template:Graph search algorithm 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]