Difference between revisions of "Thomas Lincke"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Thomas Lincke''' '''Thomas Robert Lincke''',<br/> a Swiss American computer scientist and Ph.D. from ETH Zurich. His Ph.D. thesis ti...") |
GerdIsenberg (talk | contribs) |
||
(One intermediate revision by the same user not shown) | |||
Line 5: | Line 5: | ||
=Selected Publications= | =Selected Publications= | ||
− | <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]] | ||
− | * [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]] | + | * [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''[https://content.iospress.com/articles/icga-journal/icg23302 Large Endgame Databases with Limited Memory Space]''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]] |
* [[Thomas Lincke]], [[Roel van der Goot]] ('''2000'''). ''Marvin wins Awari Tournament''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]] | * [[Thomas Lincke]], [[Roel van der Goot]] ('''2000'''). ''Marvin wins Awari Tournament''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]] | ||
* [[Thomas Lincke]] ('''2000'''). ''[http://www.springerlink.com/content/detrvtjevmqd5p2g/ Strategies for the Automatic Construction of Opening Books]''. [[CG 2000]] | * [[Thomas Lincke]] ('''2000'''). ''[http://www.springerlink.com/content/detrvtjevmqd5p2g/ Strategies for the Automatic Construction of Opening Books]''. [[CG 2000]] |
Latest revision as of 17:09, 16 November 2020
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
- Thomas Lincke (1994). Perfect Play using Nine Men’s Morris as an example. Diploma thesis, ETH Zurich, pdf
- 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
References
- ↑ Thomas Lincke (2002). Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D. thesis, ETH Zurich
- ↑ Nievergelt > Former Group Members
- ↑ ICGA Reference Database
- ↑ dblp: Thomas R. Lincke