Thomas+Lincke


 * Home * People * Thomas Lincke**

toc a Swiss computer scientist and Ph.D. from ETH Zurich, thesis title //Exploring the Computational Limits of Large Exhaustive Search Problems//, 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, and is author of the Awari program [|Marvin], winner of the gold medal of the 5th Computer Olympiad 2000 in London.
 * Thomas Robert Lincke**,

=Selected Publications=
 * Thomas Lincke (**1994**). //Perfect Play using Nine Men’s Morris as an example//. Diploma thesis, ETH Zurich, [|ps]
 * Thomas Lincke, Ambros Marzetta (**2000**). //Large Endgame Databases with Limited Memory Space//. 5th Computer Olympiad Workshop
 * Thomas Lincke, Ambros Marzetta (**2000**). //Large Endgame Databases with Limited Memory Space//. ICGA Journal, Vol. 23, No. 3
 * Thomas Lincke, Roel van der Goot (**2000**). //Marvin wins Awari Tournament//. ICGA Journal, Vol. 23, No. 3
 * Thomas Lincke (**2000**). //[|Strategies for the Automatic Construction of Opening Books]//. CG 2000
 * Thomas Lincke (**2002**). //Exploring the Computational Limits of Large Exhaustive Search Problems//. Ph.D thesis, ETH Zurich, [|pdf]
 * Thomas Lincke (**2002**). //[|Position-Value Representation in Opening Books]//. CG 2002

=External Links=
 * [|Thomas Lincke's ICGA Tournaments]
 * [|Thomas Robert Lincke von Wyssachen in Zürich] from [|moneyhouse.ch]

=References= =What links here?= include page="Thomas Lincke" component="backlinks" limit="40"
 * Up one level**