Abstract:
The basic method for solving the problem of choosing a move from a position of two opponents with complete information is that proposed by Shannon. In this paper a probabilistic approach is employed to investigate the applicability boundary of the Shannon algorithm.