At One Place

How many possible positions are there in Go?

How many possible positions are there in Go?
about 2.08 × 10^170
The number of legal Go positions exceeds the number of atoms in the observable universe by a factor of about 10^90 — and it exceeds the number of legal chess positions by a factor of 10^126.

The number of legal positions on a 19×19 Go board was computed exactly in 2016: 208,168,199,381,979,984,699,478,633,344,862,770,286,522,453,884,530,548,425,639,456,820,927,419,612,738,015,378,525,648,451,698,519,643,907,259,916,015,628,128,546,089,888,314,427,129,715,319,317,557,736,620,397,247,064,840,935 — a 171-digit number. That is why Go resisted computer play for twenty years after chess fell: the search tree is too large for brute force by an unbridgeable margin, so a program has to evaluate positions by pattern rather than by calculation. AlphaGo beat Lee Sedol in 2016, the same year the count was finished.

How the figure is arrived at

Not brute-force enumeration, which is impossible, but dynamic programming: count the legal configurations row by row, tracking only the information about the partial board that affects whether later rows can be legal. The computation took months of CPU time and several terabytes of storage, and its result was verified independently by computing modulo several large primes.

Other numbers and possibilities counts

Common questions

How many possible positions are there in Go?
about 2.08 × 10^170
How is that estimated?
Not brute-force enumeration, which is impossible, but dynamic programming: count the legal configurations row by row, tracking only the information about the partial board that affects whether later rows can be legal. The computation took months of CPU time and several terabytes of storage, and its result was verified independently by computing modulo several large primes.

Related pages

Sources

  1. Calculated on this page — At One Place

How these figures are compiled and checked