Difference between revisions of "Thomas Lincke"

From Chessprogramming wiki
Jump to: navigation, search
(Tags: Mobile edit, Mobile web edit)
 
Line 5: Line 5:
  
 
=Selected Publications=
 
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Lincke:Thomas_R=.html dblp: Thomas R. Lincke]</ref>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Lincke:Thomas_R=.html dblp: Thomas R. Lincke]</ref>
 
* [[Thomas Lincke]] ('''1994'''). ''Perfect Play using Nine Men’s Morris as an example''. Diploma thesis, [[ETH Zurich]], [http://muehlespieler.de/download/diplomarbeit_nine_mens_morris.pdf pdf]
 
* [[Thomas Lincke]] ('''1994'''). ''Perfect Play using Nine Men’s Morris as an example''. Diploma thesis, [[ETH Zurich]], [http://muehlespieler.de/download/diplomarbeit_nine_mens_morris.pdf pdf]
 
* [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[5th Computer Olympiad#Workshop|5th Computer Olympiad Workshop]]
 
* [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[5th Computer Olympiad#Workshop|5th Computer Olympiad Workshop]]

Latest revision as of 17:09, 16 November 2020

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
  4. dblp: Thomas R. Lincke

Up one level