British Museum algorithm

From Wikipedia, the free encyclopedia

Graph and tree
search algorithms
Listings
  • Graph algorithms
  • Search algorithms
  • List of graph algorithms
Related topics
  • v
  • t

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.

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 Public Domain This article incorporates public domain material from the NIST document: Black, Paul E. "British Museum technique". Dictionary of Algorithms and Data Structures..

References[]

  1. ^ 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.
Retrieved from ""