AI Checkers
Implementation of an AI for the board game Checkers
Checkers (also known as Draughts) is a highly popular game worldwide. I collaborated with a friend to create an AI that operates based on the Minimax algorithm. To optimize the algorithm, we implemented alpha-beta pruning and state-saving features, which reduced unnecessary computations when searching for the next optimal move. This is critical as games often have time constraints, and an efficient implementation means less thinking time wasted. Our original Java implementation is available on GitHub (link provided). Additionally, I have integrated a lightweight version of our AI into an open-source JavaScript checkers game, which is also available on GitHub (link provided) and can be played via the demo provided below.
Demo
Play against the AI in the game below to try out our algorithm: