Minimax Algorithm for a King and Rook vs King Chess Endgame

Abstract

In this paper, we will take a look at an Аrtificial Intelligence based chess program, which portrays a White King and Rook vs Black King endgame scenario. First, we will take a look at the evolution of this chess program, and how it progressed from being purely algorithmic to employing Artificial Intelligence. Next, we will briefly explore how the main program works and scrutinize all of its possible functions. Moreover, the version of the program which obtains all relevant statistics as well as the circumstances surrounding their attainment will also be discussed. Finally, we will conclude the paper by analyzing the results of the exhaustive testing and showcasing a hypothesis derived from the aforementioned results.