Design and Realization of Surakarta Chess Game Program

Abstract

At present, the research on Surakarta game is relatively less than other games. Aiming at this situation, a Surakarta chess game program is designed. This program implements basic algorithms such as board representation, move generation, game evaluation, and game tree search. The evaluation of the chess game takes into account the number of pieces, moving range, attacking range, attacking power of pieces, board value, arc value, etc. The game tree search algorithm uses the Alpha-Beta pruning algorithm. The whole program is fully functional and has a strong game level, which provides reference significance and reference value for related research. The program won the second prize at the national level in the computer game competition for college students in China, and the second prize at the provincial level in the computer game competition for college students in Liaoning Province, which verified the feasibility of the game program algorithm.