Connect-4 using Alpha-Beta pruning with minimax algorithm

Abstract

The classic game of Connect-4 is fading from the face of society, especially with the younger generations, due to the addictive instance of digital games available anywhere; hence measures to preserve the continuity of this game lie in the recreation of the game in the virtual environment. In this paper, the formulation of a classic Connect-4 game utilizing the implementation of Alpha-Beta Pruning with Minimax algorithm is carried out with the objective of modifying its parameters to determine its influence on the execution of the game. The parameters involved in the modification process include the depth of search and size of board, as a small change of constant can lead to a drastic difference. Minimax algorithm serves the purpose of enabling the computer (AI) to place its piece strategically, whereas Alpha-Beta Pruning is incorporated to reduce the size of its search tree. All results pertaining to the changes made have been recorded accordingly, and the optimal constant of parameters is identified, leading to an ideal execution of the game.