Thomas Lincke

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Thomas Lincke

Thomas Robert Lincke,
a Swiss American computer scientist and Ph.D. from ETH Zurich. His Ph.D. thesis titled Exploring the Computational Limits of Large Exhaustive Search Problems [1] 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

  1. Thomas Lincke (2002). Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D. thesis, ETH Zurich
  2. Nievergelt > Former Group Members
  3. ICGA Reference Database (pdf)
  4. dblp: Thomas R. Lincke

Up one level