Post #3511880

Years ago, started "milhouse", my conventional checker-playing engine that used α-β search. I did a brief excursion into making a similar program with Claude Code (α-β search, but with self play to learn the evaluation function implemented with neural nets). It was somewhat successful, but 16 days ago I decided to try Monte Carlo tree search, which I knew little about. Now it can beat Martin Fierz' "simplech" handily, a level of play not reached by me before. And still getting better.