Archive for date: April 4, 2007

Lincke’s Thesis: Exploring the Computational Limits of Large Exhaustive Search Problems

April 4, 2007 | General | By: Mark VandeWettering

Thomas Lincke invented a technique called “drop-out-expansion” for the automatic construction of opening books. That seemed like a pretty nifty thing: it’s used by Martin Fierze’s Cake program to compute a vast database of opening positions in checkers. I wanted to know what it was about, and my Google Fu revealed this thesis: Exploring the […]

Share Button

Another paper on endgame databases in Checkers…

April 4, 2007 | General | By: Mark VandeWettering

Dodgen and Trice talk about their 7 piece perfect play endgame database, which can be used to guarantee wins or stall defeats as long as possible when confronted by positions having 7 or fewer pieces. Most endgame databases contain only the game theoretic value for positions, and therefore might have difficulty actually finding the winning […]

Share Button