Template:ChessBase Best-Publication Award

Winners of the ChessBase Best-Publication Award 1999-2010:

• Ernst Heinz (1999). Scalable Search in Computer Chess.
• Eugene Nalimov (2000). Endgame Tablebases
• John Romein (2001). Multigame - An Environment for Distributed Game-Tree Search. Ph.D. thesis, Vrije Universiteit, supervisor Henri Bal, pdf
• Brian Sheppard (2002). Towards Perfect Play of Scrabble. Ph.D. thesis, Maastricht University, pdf
• Jeroen Donkers (2003). Nosce Hostem - Searching with Opponent Models. Ph.D. thesis, Universiteit Maastricht, pdf
• Mark Winands (2004). Informed Search in Complex Games. Ph.D. thesis, Universiteit Maastricht, pdf
• Akihiro Kishimoto (2005). Correct and Efficient Search Algorithms in the Presence of Repetitions. Ph.D. thesis, University of Alberta, pdf
• Darse Billings (2006). Algorithms and Assessment in Computer Poker. Ph.D. thesis, University of Alberta
• Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2007). Checkers is Solved. Science, Vol. 317, no. 5844

Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2005). Solving Checkers. IJCAI 2005, pdf

• Guillaume Chaslot, Mark Winands, Jos Uiterwijk, Jaap van den Herik, Bruno Bouzy (2008). Progressive Strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation, Vol. 4, No. 3
• Olivier Teytaud, Jean-Yves Audibert, Guillaume Chaslot, Louis Chatriot, Christophe Fiter, Sylvain Gelly, Rémi Munos, Jean-Baptiste Hoock, Julien Pérez, Arpad Rimmel, Yizao Wang, Thomas Hérault, Vincent Danjean (2009). MoGo that won: one 19x19 Go game with 6-stone handicap vs a professional player, one 19x19 Go game with 7-stone handicap vs a professional player, one 9x9 Go game as Black vs a professional player.
• Shih-Chieh Huang, Rémi Coulom (2010). Erica, the Go Program that won the Go 2010 Computer Olympiad.