The game method of checkers based on alpha-beta search strategy with iterative deepening

摘要

With the game of checkers board games, this paper proposes an algorithm based on the alpha-beta search and iterative deepening optimization. Through adjusting the search depth dynamically, we have solved the problems caused by changes in chess. Also, this paper designs a kind of zoning evaluation function considering pawn difference, in which the board is divided into six regions and assessed respectively. To quantify the pawn difference, experiments are conducted to get the reasonable scaling factor of the king and ordinary.