An Upper Bound for the Number of Reachable Positions

By Shirish Chinchalkar. 1996

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Matthew Lai

Citations in the corpus

• Giraffe: Using Deep Reinforcement Learning to Play Chess (2015, methodology): “The search tree size for chess is estimated to be about 10 123 [6] (10 46 without repetitions [7]) which is more than one hundred orders of magnitudes higher than what is computationally feasible using modern computers.”