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

Published on 2007-04-04 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 Computational Limits of Large Exhaustive Search Problems

Neat.

[tags]Checkers[/tags]