Candidate Moves Method implementation in MiniMax search procedure of the Achilles chess engine

This paper presents the Candidate Moves Method for parallelization of the MiniMax search procedure. As the framework for this new method the basic MiniMax procedure is defined. The original modification of the classic MiniMax procedure is presented in detail. All of these theoretical results and novelties are successfully implemented and verified in authors' chess application Achilles, which is the cluster version of the Axon chess engine.