Abstract:
A probabilistic approach is applied to determining the validity range of Shannon's algorithm for choosing the move in a game of two fully informed players. The effect of expanding the validity range is studied for the case of low-ranking ending positions in the game tree. The rate at which the model estimate converges to the true one is estimated.