A colleague at work starts being interested in board games programming. He started asking me questions from time to time on how to write a Quixo solver. In fact, he asked me enough questions to trigger my lets-skip-sleeping-time-sense.
The quixo game rules makes the board evaluation kinda poor, making the choice of a MonteCarlo Tree Search quite natural over an AlphaBeta.
I’ve always been intrigued by functional programming paradigme, so I decided to try writing it in OCaml. Let’s face it, it will take some time before a first working version :]
Project and details can be found on my gitlab page.