Thomas Robert Lincke,
a Swiss computer scientist and Ph.D. from ETH Zurich, thesis title Exploring the Computational Limits of Large Exhaustive Search Problems[1], which covers new techniques in retrograde analysis and opening book construction and their position-value representation with additional information of at-least-draw, at-most-draw, and cycle-draw in the games of Amazons, Awari, Checkers, Chess, Nine Men’s Morris and Othello. Thomas Lincke was member of Jürg Nievergelt’s research group [2], and is author of the Awari program Marvin, winner of the gold medal of the 5th Computer Olympiad 2000 in London.
Table of Contents
a Swiss computer scientist and Ph.D. from ETH Zurich, thesis title Exploring the Computational Limits of Large Exhaustive Search Problems [1], which covers new techniques in retrograde analysis and opening book construction and their position-value representation with additional information of at-least-draw, at-most-draw, and cycle-draw in the games of Amazons, Awari, Checkers, Chess, Nine Men’s Morris and Othello. Thomas Lincke was member of Jürg Nievergelt’s research group [2], and is author of the Awari program Marvin, winner of the gold medal of the 5th Computer Olympiad 2000 in London.
Selected Publications
[3] [4]External Links
References
What links here?
Up one level