The Grand Chess Tree is a distributed volunteer computing system that counts how many possible move sequences exist up to a given depth in a game of chess. Since chess is a branching game—each move creates new possibilities. At depth 1, White has 20 moves. At depth 2, there are 400 possible positions. By depth 3, it’s 8,902. Then 187K, 4.8M, 3.2B…
Currently searching at a rate of around 50 billion positions a second!
If you're interested to be part of the project then come join us
The Grand Chess Tree is a distributed volunteer computing system that counts how many possible move sequences exist up to a given depth in a game of chess. Since chess is a branching game—each move creates new possibilities. At depth 1, White has 20 moves. At depth 2, there are 400 possible positions. By depth 3, it’s 8,902. Then 187K, 4.8M, 3.2B…
Currently searching at a rate of around 50 billion positions a second!
If you're interested to be part of the project then come join us