A simple c++ console application. A connect-4 game with reasonable ai.
The Alpha-beta prunning is an adversarial searching algorithm used for playing of two-player games. It is an advanced algorithm which is evaluated by the minimax algorithm in its search tree.
Reference from Minimax with Alpha Beta Pruning and Brian's Project - Connect Four
This project is to learn the alpha-beta pruning by implementing the algorithm to a simple connect-4 game. Because there are too many possible situations for the search tree, the computer cannot solve the search tree by simply implement the minimax algorithm just like the tictactoe project. Therefore, alpha-beta pruning is implemented to limit the possible predictation and make the reasonable decision.
Run the main.o file ./connect4 in terminal and start playing the connect-4.