British Museum algorithm

The British Museum algorithm is a general approach to finding a solution by checking all possibilities one by one, beginning with the smallest. The term refers to a conceptual, not a practical, technique where the number of possibilities is enormous.

Graph and tree search algorithms
α–β pruning Backtracking Beam search Best-first search Branch & bound Breadth-First Search (BFS) British Museum Depth-First Search (DFS) Hill climbing Iterative Deepening DFS (IDDFS) Lexicographic BFS
Shortest path
A* B* Bellman–Ford Bidirectional search D* Dijkstra's Floyd–Warshall Fringe search Iterative Deepening (IDA) Johnson's Jump point search Kruskal's Lifelong Planning A (LPA) Pathfinding SMA
Lists
Graph algorithms Search algorithms List of graph algorithms
Related topics
Dynamic programming Graph coloring Graph traversal Minimum spanning tree Search games Threaded binary tree Tree traversal

Newell, Shaw, and Simon[1] called this procedure the British Museum algorithm

"... since it seemed to them as sensible as placing monkeys in front of typewriters in order to reproduce all the books in the British Museum."

See also

Sources

Original text by This article incorporates public domain material from the NIST document: Black, Paul E. "British Museum technique". Dictionary of Algorithms and Data Structures..

References

Newell, A.; Shaw, J. C.; Simon, H. A. (1958). "Elements of a Theory of Human Problem Solving". Psychological Review. American Psychological Association. 65 (3): 151–166. doi:10.1037/h0048495.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.