This will be the final week’s post as I am going to explain how well the Minimax algorithm runs by battling it against the Negamax algorithm. Before continuing, I am […]

In this week’s post, I am going to explain how Pruning works in Minimax and Negamax algorithm. Consider the algorithm starts its way by checking the foremost left side of […]

After reading the previous week’s study, we concluded that we couldn’t implement the A* algorithm. The reasons that we couldn’t implement it are the heuristic function explanation which is oversimplified […]

During our search for the compatible AI, we stumbled upon a paper which implemented the A* algorithm in Congklak game. Below is the link to the paper: Since the A* […]

During this week, we’ve managed to finalize our game logic code. I am going to explain the upper part of the game logic code due to the workload that was […]