Обчислювальна складність гри в шахи: Від числа Шеннона до алгоритмів оцінки позиції

Abstract

The report analyzes the mathematical challenges associated with the astronomical computational complexity of chess and the methods for overcoming them using combinatorial analysis and probability theory. The role of the scale of the game space, defined by Claude Shannon, in the formation of strategy for both humans and artificial intelligence is investigated. The application of combinatorics for calculating forced variations and the use of probabilistic heuristics in chess engine position evaluation functions are considered in detail.