British Museum algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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.

See also

[edit | edit source]

Sources

[edit | edit source]

Public Domain This article incorporates public domain material from Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..

References

[edit | edit source]