British Museum algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by imported>OAbot at 16:28, 28 May 2025 (Open access bot: url-access updated in citation with #oabot.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Use dmy dates Template:Use British English

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

Script error: No such module "template wrapper"..

References

<templatestyles src="Reflist/styles.css" />

  1. Script error: No such module "Citation/CS1".

Script error: No such module "Check for unknown parameters".