Moves are represented based on the depth value of the alpha and beta and the kind of piece with respect to this depth position on the chess board. To proceed with this algorithm, initially alpha and beta variables are considered and an initial depth is assigned as an integer and then these values are incremented or decremented and compared to follow the tree search process.

The famous tree search algorithm known as alpha beta pruning algorithm is used to decide the best move for the computers from all the possible moves in front of the computer. All the possible conditions are checked for all the pieces with respect to the position of the board initially and later the actual moves against the human moves are done in a separate way. The moves are assigned to these pieces based on the square positions, the corresponding characters assigned to the squares and position of the square on the total board. A typical switch and case condition loop is used to check the type of piece initially and then based on the case identified the moves are defined. These moves are mainly decided by the position of the piece on the chess board and few predefined moves are assigned to the piece based on the nature of the piece on the board. Move against the human move from the computer side need lot of estimations and eliminations and in there, typical tree search algorithm can be used to search for the best move possible. A separate module known as chess engine is designed in this program to handle all the possible moves and a separate module of code is required as the possible moves are really high in a chess game. Representing the possible moves is really an important aspect in designing the chess game and this section explains the actual procedure followed to handle all the possible moves in this application.

Design of this chess game is divided in to following modules:

Chess source code in java