Iterative Deepening Chess Engine with Alpha Beta Pruning

An essential component of developing a chess engine is its depiction of the chess board, which influences the way the engine moves over the board and follows the rules. One way to lessen the strain on the chess engine's hardware is to use the minimax algorithm. To enhance this searching algorithm, a most promising approach becomes vital. One such a searching algorithm is Alpha-Beta Pruning Algorithm. The main concept of the algorithm is to search the tree for unwanted nodes and delete them. Thus, to enhance the chess engine, it is required to refine it through iterative development. Few optimization techniques are incorporated to enhance the search algorithm. To evaluate the progress of software, it is tested by comparing it with its previous version. To enhance the consistency and precision, arbitrary test points are tested along with the critical bug fixing. Search is refined further in decision-making and hence Search proficiencies are strengthened. Finally, Analysis is made to keenly observe the improvement and based on it is further categorized.