Cake 1.88q is the latest version of my checkers engine. It is technically quite similar to its 8-years-older predecessor (Cake 1.85), but I used machine learning techniques, specifically logistic regression, to achieve a large improvement of the evaluation function (Cake 1.86) and later tuned the search parameters with lots of engine matches (Cake 1.87), and returned to the evaluation function for Cake 1.88, 1.88d and 1.88q. You can read more on how it was made.

Cake 1.88q is one of the world's most powerful checkers engines for the PC platform, and plays stronger than any human. It is quite frustrating to play against it, but it is a great tool for analysis. If you are looking for something even better, then use Ed Gilbert's KingsRow engine.

Why is it so good?

Cake makes use of an endgame database, which means it has perfect knowledge of the value of any endgame with few pieces. Few in this context means any number between 4 and 10, depending on whether you download the larger endgame databases. Cake also makes use of a self-generated opening book with 93'000 moves by default. You can expand this by downloading the huge opening book, which contains nearly 2 million moves, more than all human opening theory. Between opening and endgame, Cake makes use of sophisticated algorithms to choose its next move, searching approximately 5 million positions per second on a modern computer. Cake is much stronger than the famous Chinook program was at the time of its world championship matches against Marion Tinsley; both because algorithms and evaluation are much (much much!) better, and also because of the huge increase in computer processing speed over the last decade.


All code in Cake is original code. However, no man is an island, and a lot of other people have been important in the development of Cake.
Last updated by Martin Fierz on January 30, 2020