How Many Chess Games are Possible?
Summary
The article estimates the number of short chess games using both a Fermi-approximation and Knuth's path-product estimator. It shows how to sample game trees and discusses variance and reliability, concluding an order of magnitude around 10^151 for short games and explaining why the Knuth method provides more robust estimates.