Chess has approximately 10^120 possible game positions, making exhaustive search (British Museum algorithm) computationally impossible; even if all atoms in the universe performed evaluations at nanosecond speeds since the Big Bang, we would still be 14 orders of magnitude short of evaluating all possibilities.
Install our extension to search inside any video instantly.
Chess Universe Size: Why Brute Force Fails! #shortsAdded:
In the end, it looks like, according to Claude Shannon, there are about 10 to 100 to the 120th leaf nodes down there. And if you're going to do the a British Museum treatment of this tree, you'd have to do 10 to the 120th static evaluations down there at the bottom.
If you're going to see which one of the moves is best at the top. So, if all of the atoms in the universe were doing static evaluations at nanosecond speeds since the beginning of the Big Bang, we'd still be 14 orders of magnitude short.
So, the British Museum algorithm is not going to work.
Related Videos
Agentforce NOW AMA: Build with React and Salesforce Multi-Framework
SalesforceDevs
490 views•2026-05-28
How agent o11y differs from traditional o11y — Phil Hetzel, Braintrust
aiDotEngineer
450 views•2026-05-28
WEB TECHNOLOGIES UNIT-2 | Degree 4th sem BCOM Computers web technologies unit-2 full explanation💯✅
LearnwithSahera
1K views•2026-05-29
More tests are always better? How to use AI to identify tests that bring little value
Alliance4Qualification
335 views•2026-05-29
Search Algorithms Explained in 60 Seconds! 🤖💨
samarthtuliofficial
218 views•2026-06-01
People of Game of Thrones using JavaScript DOM
AltCampus
296 views•2026-05-30
Introduction to Problem Solving Part - 1 | Lecture 1 | Intermediate DSA
ascensionix
107 views•2026-05-29
So What's Odin Lang Even Good For
TechOverTea
131 views•2026-06-01
