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 

Listings 

Related topics 
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."
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
This article is issued from
Wikipedia.
The text is licensed under Creative
Commons  Attribution  Sharealike.
Additional terms may apply for the media files.