Duck Chess

Instructions

You can change the type of the players at any time, even midgame.

• Human: Use the mouse to move the pieces
• Alpha Beta Pruning AI: uses alpha beta pruning to search for the best move
• Monte Carlo Tree Search AI: uses MCTS to search for the best move

White moves first, then clicks an empty square for the duck to start out on.

From there, it is like normal chess, but after a turn, that player has to move the duck somewhere (any empty space). The duck can't be captured, and is just an obstacle.

---

I made this based off of the github repository provided by Sebastian Lague in this video.

His repository has an MIT license, and while I didn't directly copy the code, I took significant inspiration from it. Therefore, this project also has the MIT license. The github repo containing my code can be found here.

I wanted to work from an implementation of chess and nothing more, but the repository was very large and interconnected, so I couldn't easily separate the main game from the AI or Utility classes.

Instead, I ended up using it as a guide for making my own codebase, rather than building off of it. Plus, duck chess has different rules that it was worth re-creating from scratch.