Wikispaces : chessprogramming - items matching description

Amazons

GerdIsenberg — Sat, 12 Aug 2017 11:51:19 GMT

Home * Games * Amazons

		Amazons, (Game of the Amazons, El Juego de las Amazonas) a two-player abstract strategy game invented in 1988 by Walter Zamkauskas of Argentina ^[1] . El Juego de las Amazonas is a trademark of Ediciones de Mente. In 1998 and 1999, Hiroyuki Iida organized the first two computer Amazons championships, which were held at the Computer Games Research Institute of Shizuoka University ^[2] ^[3] . Computer Amazons is played at the Computer Olympiad since London 2000. Amazons is usually played on a 10 x 10 board, but can be played on boards of arbitrary size. The two players, White and Black are each given four amazons in predefined locations. A supply of markers (checkers, poker chips, etc.) is also required. White makes the first move with one of his amazons, which move like a queen in chess, except captures. Each move contains two mandatory parts, moving the amazon and throwing an arrow from its target square to one of its attacked empty squares, which is marked and permanently blocked. Amazon and the arrow can't land on or cross over any own or opponent amazon or arrow. The last player to be able to make a move, which includes throwing an arrow, wins.
Position after 1.d1-d6/g9 ^[4]

Selected Publications

Computer Olympiads

Selected Programs

Gold medalists from the Computer Olympiad

Photos

Maastricht 2002



Maastricht 2002 winners, Richard J. Lorentz, Jens Lieberum, Johan de Koning ^[5]

Yokohama 2013

Yokohama 2013 award ceremony ^[6] , Richard J. Lorentz, Johan de Koning, Jaap van den Herik ^[7]

Branching Factor

excerpt of Patrick Hensgens' 2001 master's thesis ^[8] :

In the initial position the first player has 2176 possible moves. This is a huge number, especially when compared to other AI games, where most games have a branching factor below 50 in the initial position (e.g., Chess 20, Lines of Action 36, Checkers 7, Draughts 9). Fortunately the branching factor in the game of Amazons decreases rapidly as the game progresses. In the endgame the branching factor is usually below 50.

Investigating the average branching factor of Amazons, we encounter a strange phenomenon. From the experiments we performed for finding the average branching factor we observed that this number is quite different for both players. The first player has an average branching factor of 374 while the second player has an average branching factor of 299. This means that to compute the game-tree complexity we need a formula that takes into account that both players have a different branching factor.

Furthermore, we observed that the average branching factor for both players increases with decreasing playing strength of both players.

Selected Publications

^[9] ^[10]

1999

Nobusuke Sasaki, Hiroyuki Iida (1999). Report on the First Open Computer-Amazons Championship. ICCA Journal, Vol. 22, No. 1

2000 ...

Patrick Hensgens, Jos Uiterwijk (2000). A Knowledge-Based Approach of Amazons. 5th Computer Olympiad Workshop
Michael Buro (2000). Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. CG 2000, pdf
Hiroyuki Iida, Martin Müller (2000). Report on the Second Open Computer-Amazons Championship. ICGA Journal, Vol. 23, No. 1
Elwyn Berlekamp (2000). Sums of 2 X N Amazons. in F. Thomas Bruss and Lucien le Cam, eds. GameTheory, Optimal Stopping, Probability and Statistics: Papers in honor of Thomas S. Ferguson. Institute of Mathematical Statistics Lecture Notes - Monograph Series, Vol. 35

2001

Tsuyoshi Hashimoto, Yoichiro Kajihara, Nobusuke Sasaki, Hiroyuki Iida, Jin Yoshimura (2001). An Evaluation Function for Amazons. Advances in Computer Games 9
Martin Müller (2001). Solving 5x5 Amazons. 6th Game Programming Workshop
Hiroyuki Iida (2001). 8QP wins Amazons tournament. ICGA Journal, Vol. 24, No. 3 » 6th Computer Olympiad
Patrick Hensgens (2001). A Knowledge-based Approach of the Game of Amazons. Master's thesis, Maastricht University, pdf

2002

Richard J. Lorentz (2002). First-time entry Amazong wins Amazons tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Richard J. Lorentz (2002). Finding Territory in Amazons. 7th Computer Olympiad Workshop
Raymond Georg Snatzke (2002). Exhaustive search in the game amazons. in Richard J. Nowakowski (ed) (2002). More Games of No Chance. Cambridge University Press, pdf
Martin Müller, Theodore Tegos (2002). Experiments in Computer Amazons. in Richard J. Nowakowski (ed) (2002). More Games of No Chance. Cambridge University Press
Henry Avetisyan, Richard J. Lorentz (2002). Selective Search in an Amazons Program. CG 2002
Theodore Tegos (2002). Shooting the last arrow. Master's thesis, University of Alberta, pdf

2003

Jens Lieberum (2003). Amazong wins Amazons tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad
Jens Lieberum (2003). An Evaluation Function for the Game of Amazons. Advances in Computer Games 10

2004

Akop Karapetyan, Richard J. Lorentz (2004). Generating an Opening Book for Amazons. CG 2004
Johan de Koning (2004). 8QP regains Amazons title. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad
Raymond Georg Snatzke (2004). New results of exhaustive search in the game Amazons. Theoretical Computer Science, Vol. 303, No. 3

2005 ...

Richard J. Lorentz (2005). 8QP wins Amazons tournament. ICGA Journal, Vol. 28, No. 3 » 10th Computer Olympiad
Yoshinori Higashiuchi, Reijer Grimbergen (2005). Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons. Advances in Computer Games 11
Jens Lieberum (2005). An evaluation function for the game of Amazons. Theoretical Computer Science, Vol. 349, No. 2
Julien Kloetzer, Hiroyuki Iida, Bruno Bouzy (2007). The Monte-Carlo approach in Amazons. CGW 2007, pdf
Mark Winands (2007). 8QP wins Amazons tournament. ICGA Journal, Vol. 30, No. 3 » 12th Computer Olympiad
Julien Kloetzer, Hiroyuki Iida, Bruno Bouzy (2008). A Comparative Study of Solvers for Amazons Endgames. CIG'08, pdf
Richard J. Lorentz (2008). Amazons Discover Monte-Carlo. CG 2008
Richard J. Lorentz (2009). Invader wins Amazons Tournament. ICGA Journal, Vol. 32, No. 1 » 13th Computer Olympiad
Julien Kloetzer (2009). Invader wins Amazons Tournament. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
Julien Kloetzer, Hiroyuki Iida, Bruno Bouzy (2009). Playing Amazons Endgames. ICGA Journal, Vol. 32, No. 3, pdf

2010 ...

Julien Kloetzer (2010). Monte-Carlo Opening Books for Amazons. CG 2010
Julien Kloetzer (2010). Monte-Carlo Techniques: Applications to the Game of the Amazons. Ph.D. thesis, JAIST
Johan de Koning (2011). Invader prolongs Amazons Title. ICGA Journal, Vol. 34, No. 2 » 15th Computer Olympiad
Johan de Koning (2012). Invader wins Amazons Tournament. ICGA Journal, Vol. 35, No. 4 » 16th Computer Olympiad
Jiaxing Song (2013). An enhanced solver for the game of Amazons. Master's thesis, University of Alberta, pdf
Richard J. Lorentz (2013). INVADER Wins Amazons Tournament. ICGA Journal, Vol. 36, No. 4 » 17th Computer Olympiad

2015 ...

Jiaxing Song, Martin Müller (2015). An Enhanced Solver for the Game of Amazons. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 1, pdf preprint

External Links

Game

Misc

References

^ Game of the Amazons from Wikipedia
^ Nobusuke Sasaki, Hiroyuki Iida (1999). Report on the First Open Computer-Amazons Championship. ICCA Journal, Vol. 22, No. 1
^ Hiroyuki Iida, Martin Müller (2000). Report on the Second Open Computer-Amazons Championship. ICGA Journal, Vol 23, No. 1
^ Game of the Amazons from Wikipedia
^ ICGA: Amazons by Richard J. Lorentz
^ Games Tournament 2013 - Amazons, ICGA
^ Photos 2013 Events: day 6, ICGA
^ Patrick Hensgens (2001). A Knowledge-based Approach of the Game of Amazons. Master's thesis, Maastricht University, pdf
^ Publications related to the game of Amazons, University of Alberta
^ ICGA: Amazons by Richard J. Lorentz

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
20th Computer Olympiad	Feb 5, 2018
5th Computer Olympiad	Jan 17, 2017
6th Computer Olympiad	Jul 22, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
9th Computer Olympiad	Jul 22, 2017
AI Factory	Dec 26, 2015
Amazons	Aug 12, 2017
Broderick Arneson	Jan 8, 2017
Daniel Shawul	Jan 28, 2018
Games	Feb 20, 2018
Harm Geert Muller	Mar 31, 2018
Hiroshi Yamashita	May 28, 2017
Jens Lieberum	Jan 2, 2017
Jiaxing Song	Aug 12, 2017
Johan de Koning	Jul 3, 2017
Julien Kloetzer	Jan 4, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Nebiyu	Dec 10, 2017
Nobusuke Sasaki	Jan 19, 2016
Raymond Georg Snatzke	May 26, 2015
Reijer Grimbergen	Jan 4, 2017
Richard J. Lorentz	Aug 11, 2017
Richard P. Cochran	Mar 28, 2015
Scorpio	Mar 28, 2018
Theodore Tegos	Jan 1, 2017
Thomas Lincke	Dec 22, 2016
Thomas Opfer	May 7, 2014
Ulf Lorenz	Dec 22, 2016
Yasushi Tanase	Jan 1, 2017
Yoichiro Kajihara	Dec 23, 2016

Up one Level

Arimaa

GerdIsenberg — Wed, 04 Jan 2017 10:08:44 GMT

Home * Games * Arimaa

		Arimaa, is a two-player zero-sum and perfect information abstract strategy board game, that can be played using the same equipment as chess, invented by Omar and Aamir Syed. In 2002, Omar Syed published the rules to Arimaa ^[1] and announced a $10,000 prize, available annually until 2020, for the first computer program (running on standard hardware) able to defeat each of three top-ranked human players in a three game series ^[2]. Due to its huge Branching Factor of about 17,281 ^[3], Arimaa is hard to play for computers. In 2015, David J. Wu won the Arimaa Challenge and the then $12,000 USD prize with his program Sharp ^[4], major topic in the ICGA Journal, Vol. 38, No. 1.
The players begin by setting up their pieces however they choose on their home rows ^[5]

Arimaa Pieces

Name	Number	Represented by Chess Piece
Elephant	1	King
Camel	1	Queen
Horse	2	Rook
Dog	2	Bishop
Cat	2	Knight
Rabbit	8	Pawn

Publications

^[6]

2003 ...

Omar Syed, Aamir Syed (2003). Arimaa - A New Game Designed to be Difficult for Computers. ICGA Journal, Vol. 26, No. 2
David Fotland (2004). Building a World-Champion Arimaa Program. CG 2004, word doc
Omar Syed, Jeroen Donkers (2004). The Arimaa match. ICGA Journal, Vol. 27, No. 2

2005 ...

Haizhi Zhong (2005). Building a Strong Arimaa-playing Program. word doc
Omar Syed, Jeroen Donkers (2005). The 2nd Arimaa Challenge Match. ICGA Journal, Vol. 28, No. 2
Christ-Jan Cox (2006). Analysis and Implementation of the Game Arimaa. Master's thesis pdf, Appendix B pdf
Nicolas A. Barriga (2006). Arimaa, the Game of Real Intelligence? pdf
Omar Syed (2009). The 6th Annual Arimaa Computer World Championship. ICGA Journal, Vol. 32, No. 1
Omar Syed (2009). The 6th Annual Arimaa Challenge Match. ICGA Journal, Vol. 32, No 2
Gerhard Trippen (2009). Plans, Patterns and Move Categories Guiding a Highly Selective Search. Advances in Computer Games 12, pdf
Sam Miller (2009). Researching and Implementing a Computer Agent to Play Arimaa. Thesis pdf
José Roberto Mercado Vega, Zvi Retchkiman Königsberg (2009). Modeling the Game of Arimaa with Linguistic Geometry. CIG'09, pdf » Linguistic Geometry ^[7]
José Roberto Mercado Vega, Zvi Retchkiman Königsberg (2009). A Linguistic Geometry Model for an Arimaa Bot. Neural, Parallel, and Scientific Computations, Vol. 17, pdf
Tomas Kozelek (2009). Methods of MCTS and the game Arimaa. Master's thesis, pdf
Fritz Juhnke (2009). Beginning Arimaa: Chess Reborn Beyond Computer Comprehension. Flying Camel Publications. ISBN 0-9824-2740-9
Sam Miller (2009). Researching and Implementing a Computer Agent to Play Arimaa. Thesis, University of Southampton, pdf

2010 ...

Stefano Carlini (2010). Arimaa, a New Challenge for Artificial Intelligence. M.Sc. thesis, University of Modena and Reggio Emilia, pdf
David J. Wu (2011). Move Ranking and Evaluation in the Game of Arimaa. B.Sc. thesis, Harvard College, Cambridge, Massachusetts, pdf
Tomáš Jakl (2011). Arimaa Challenge – Comparison Study of MCTS versus Alpha-Beta Methods. B.Sc. thesis, Charles University in Prague, pdf
Kanjanapa Thitipong, Komiya Kanako, Yoshiyuki Kotani (2012). Design and Implementation of Bonanza Method for the Evaluation in the Game of Arimaa. IPSJ SIG Technical Report, Vol. 2012-GI-27, No. 4, pdf
Tomáš Hřebejk (2013). Arimaa challenge - Static Evaluation Function. Master Thesis, Charles University in Prague, pdf » Automated Tuning ^[8]

2015 ...

Omar Syed (2015). The Arimaa Challenge: From Inception to Completion. ICGA Journal, Vol. 38, No. 1
David Fotland (2015). Computer Arimaa: The Beginning. ICGA Journal, Vol. 38, No. 1
David J. Wu (2015). Designing a Winning Arimaa Program. ICGA Journal, Vol. 38, No. 1, pdf ^[9]
Andy Lewis (2015). Game Over, Arimaa? ICGA Journal, Vol. 38, No. 1 ^[10]

Forum Posts

When will a computer be better at Arimaa then a human? by George Pichard, CCC, October 28, 2013

External Links

References

^ Arimaa Game Rules
^ Omar Syed and Aamir Syed (2003). Arimaa - A New Game Designed to be Difficult for Computers. ICGA Journal, Vol. 26, No. 2
^ Brian "Janzert" Haskin (2006). Arimaa Branching Factor
^ The 2015 Arimaa Challenge
^ Arimaa - Rules from Wikipedia
^ Arimaa - Academic Papers and Presentations
^ The Home Page of Linguistic Geometry by Boris Stilman
^ thesis on eval function learning in Arimaa by Jon Dart, CCC, December 04, 2015
^ Paper describing "Sharp" the program that won the Arimaa Challenge by ddyer, Game-AI Forum, January 14, 2016
^ slightly adapted version of Arimaa: Game Over? by Andy Lewis, Kingpin Chess Magazine, July 11, 2015
^ Andy Lewis (2015). Game Over, Arimaa? ICGA Journal, Vol. 38, No. 1

What links here?

Page	Date Edited
Aamir Syed	Sep 8, 2017
Advances in Computer Games 12	Jan 5, 2017
Andy Lewis	Jan 15, 2016
Arimaa	Jan 4, 2017
Automated Tuning	Feb 27, 2018
Bitboards	Nov 14, 2017
Boris Stilman	Apr 30, 2015
Brian Haskin	Aug 2, 2011
David Fotland	Jan 6, 2017
David J. Wu	Jan 28, 2016
Don Dailey	Dec 7, 2016
Dynamic Tree Splitting	Apr 10, 2017
Elephant	Sep 19, 2016
Games	Feb 20, 2018
Gerhard Trippen	Jun 8, 2015
ICGA Journal	Dec 21, 2017
Jeroen Donkers	Dec 23, 2016
José Roberto Mercado Vega	Feb 9, 2016
Mathematician	Apr 9, 2018
Monte-Carlo Tree Search	Apr 26, 2018
Move Ordering	Feb 27, 2018
Occam	Jan 21, 2016
Omar Syed	Sep 8, 2017
Peter McKenzie	Jan 7, 2016
Pioneer	Dec 23, 2017
Stefano Carlini	Jan 30, 2015
Yoshiyuki Kotani	Dec 27, 2016
Zillions of Games	May 29, 2017
Zvi Retchkiman Königsberg	Feb 9, 2016

Up one Level

Atomic Chess

GerdIsenberg — Sat, 26 Nov 2016 21:09:10 GMT

Home * Games * Atomic Chess

Atomic Chess,
a chess variant which applies the standard rules of chess, but capturing a piece leads to an explosion with the effect that, in addition to the captured piece, the capturing piece and all non-pawns on neighboring squares are removed from the board. For en passant, the center of the explosion is at the target square behind the pawn being captured. Captures that result in the explosion of the own king are illegal, and therefore a king can never capture any other piece, and it is possible to move the kings next to each other.

Atomic Check

In most variations of atomic chess, players must respond to being checked in a similar way they would in traditional chess - by moving the king out of check, blocking the check, or removing the checking piece - but an exception exists when the checked player can win the game by exploding the checking player's king. The variant of atomic chess played at Internet Chess Club is one that does not enforce check at all, where leaving the own king to be captured directly in the next move is legal ^[1].

Engines

To expand this list of engines able to play Atomic Chess, create a new engine page with the tag "atomic", or assign the tag to appropriate existing engine pages.

Publications

Sacha Droste, Johannes Fürnkranz (2008). Learning of Piece Values for Chess Variants. Technical Report TUD–KE–2008-07, Knowledge Engineering Group, TU Darmstadt, pdf
Sacha Droste, Johannes Fürnkranz (2008). Learning the Piece Values for three Chess Variants. ICGA Journal, Vol. 31, No. 4

Forum Posts

Atomic Chess by Stefan Roehrich, Winboard Forum, March 30, 2001
winboard and variant engines by shaxmatist, Winboard Forum, August 18, 2012
UCI variants support by Balint Pfliegel, CCC, December 15, 2013

External Links

Atomic chess from Wikipedia
Atomic Chess by Nick Long
Atomic Rooster - Devil's Answer, Top of The Pops, July 1971, YouTube Video
Vincent Crane, Paul Hammond, John Du Cann

References

^ Atomic chess from Wikipedia

What links here?

Page	Date Edited
Acorn Atom	Dec 11, 2016
Atom Chess	Dec 11, 2016
Atomic Chess	Nov 26, 2016
Atomystica	Oct 2, 2014
Chess	Jan 21, 2018
Engines	Mar 10, 2018
Games	Feb 20, 2018
Pulsar	May 4, 2017
PyChess	Dec 28, 2017
Sacha Droste	Dec 10, 2014

Up one Level

Awari

GerdIsenberg — Tue, 14 Feb 2017 17:05:35 GMT

Home * Games * Awari

		Awari, a variation of the two-player abstract strategy mancala board game Oware or Awele. Awari was played five times at Computer Olympiads, from the 1st Computer Olympiad in 1989 until the 5th Computer Olympiad in 2000. In 1990, Victor Allis, Maarten van der Meulen, and Jaap van den Herik first applied retrograde analysis to Awari ^[1], in 2000 and 2002 further elaborated by Roel van der Goot ^[2] and Thomas Lincke respectevely ^[3]. Awari was strongly solved by John Romein and Henri Bal in 2002 - either side can force a draw ^[4]. They developed a program that computes the best move and eventual outcome for all 889,063,398,406 positions that can possibly occur in Awari and further published a Java applet to play against their Awari Oracle, a potentially infallible opponent. The database requires 778 GiB stored on disk and was generated using parallel retrograde analysis with a cluster of 72 dual PIII @ 1 GHz with 1 GiB of main memory each, connected through Myrinet, which took 51 hours ^[5].
Front side of owari game variant ^[6]

Rules

Computer Olympiads

See also

Selected Publications

Rules

Owari or Awari is played on a board that contains two rows or depending on the layout, sectors of six pits called "houses", in which seeds (pieces or stones) are kept. Each player owns one of the rows. The game starts with four seeds in each pit. When a player is to move, he chooses one of his own nonempty pits, takes all seeds from it, and sows them one by one, counterclockwise over the remaining pits, skipping the emptied pit if there are more than 11 seeds. If the last seed ends in an opponent’s pit and contains two or three seeds after sowing, they are captured. If the second last pit holds the same conditions, they are captured as well, and so on. The objective of the game is to capture more than 24 seeds. The player must give the opponent a countermove, unless no such move is available. If a player cannot move, the remaining seeds are captured by the opponent. A repeated position leads to an even division of the remaining stones, ending the game ^[7]. The rules slightly differ from one country to another. For example, the "grand slam rule", which states what happens if all opponent’s pieces are captured in a single move (if allowed at all !) comes in many variants. The rules of computer-aided play of Awari concerning repetitions, captures and leaving the opponent without countermove ^[8] were defined by Victor Allis, Maarten van der Meulen, and Jaap van den Herik in 1991 ^[9]

Computer Olympiads

Selected Publications

1989

Jean Retschitzki (1989). Evidence of Formal Thinking in Baoule Awele Players. in Heterogenity in Cross-cultural Psychology. Swets Zeitlinger, Amsterdam

1990 ...

Maarten van der Meulen, Victor Allis, Jaap van den Herik (1990). Lithidion: an Awari-playing Program. Technical Report 90-05, University of Limburg
Victor Allis, Maarten van der Meulen, Jaap van den Herik (1990). Databases in Awari. Technical Report CS-90-5, University of Limburg
Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Omniscience in Lithidion. Heuristic Programming in Artificial Intelligence 2
Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Databases in Awari. Heuristic Programming in Artificial Intelligence 2

2000 ...

Jack van Rijswijck (2000). Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari. CG 2000, pdf
Roel van der Goot (2000). Awari Retrograde Analysis. CG 2000
Thomas Lincke, Roel van der Goot (2000). Marvin Wins Awari Tournament. ICGA Journal, Vol. 23, No. 3
Jean Retschitzki (2000). Strategies of Expert Awele Players. International Colloquium "Board Games in Academia III". Florence
Thomas Lincke (2002). Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D thesis, ETH Zurich, pdf » Repetitions ^[10]
John Romein, Henri Bal (2002). Awari is Solved. ICGA Journal, Vol. 25, No. 3
Jeroen Donkers (2002). Comments on the Awari Solution. ICGA Journal, Vol. 25, No. 3
John Romein, Henri Bal (2003). Solving the Game of Awari using Parallel Retrograde Analysis. IEEE Computer, Vol. 36, No. 10

Forum Posts

Awari? by Darse Billings, rgc, August 21, 1992
awari macala by Eric van Riet Paap, rgc, December 05, 1994

External Links

Awari (ICGA Tournaments)
Awari Oracle - Mancala World - Wikia
Oware - Mancala World - Wikia
Oware from Wikipedia
Ayoayo from Wikipedia
Oware - Played all over the world
Awari by Oswin Aichholzer (German)
Toto - Africa (Falling in Between Live), March 26, 2007, Le Zénith, Paris, YouTube Video
lineup: Steve Lukather, Bobby Kimball, Greg Phillinganes, Simon Phillips, Leland Sklar, Tony Spinner

References

^ Victor Allis, Maarten van der Meulen, Jaap van den Herik (1990). Databases in Awari. Technical Report CS-90-5, University of Limburg
^ Roel van der Goot (2000). Awari Retrograde Analysis. CG 2000
^ Thomas Lincke (2002). Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D thesis, ETH Zurich
^ John Romein, Henri Bal (2002). Awari is Solved. ICGA Journal, Vol. 25, No. 3
^ Awari Oracle - Mancala World - Wikia
^ Front side of owari game variant, possibly made in Cameroon. CC BY-SA 3.0, Wikimedia Commons, Oware from Wikipedia
^ John Romein, Henri Bal (2002). Awari is Solved. ICGA Journal, Vol. 25, No. 3
^ Awari Oracle - Mancala World - Wikia
^ Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Databases in Awari. Heuristic Programming in Artificial Intelligence 2
^ Re: Aquarium IDEA, repetitions, and minimax over cycles by syzygy, OpenChess Forum, September 22, 2012

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
5th Computer Olympiad	Jan 17, 2017
Awari	Feb 14, 2017
Bao	Dec 23, 2016
Darse Billings	Feb 14, 2017
Eric van Riet Paap	Feb 14, 2017
Games	Feb 20, 2018
Henri Bal	Aug 5, 2016
Jean Retschitzki	Jul 1, 2014
John Romein	Aug 5, 2016
Kalah	Dec 22, 2016
Maarten van der Meulen	Dec 13, 2016
Mathematician	Apr 9, 2018
Retrograde Analysis	Mar 21, 2017
Search	Feb 1, 2018
Steve Thomas	Feb 6, 2017
Thomas Lincke	Dec 22, 2016

Up one Level

Backgammon

GerdIsenberg — Fri, 22 Dec 2017 19:26:15 GMT

Home * Games * Backgammon

		Backgammon, a turn-based two-player tables board game of chance and strategy with 15 checkers each on a board of 24 spaces or points. One moves according to rolls of a pair of dice, trying to bring own checkers home and bear them off before the opponent does ^[1]. Opponent checkers can be "hit" and returned to the start. Backgammon programs were pioneered in the late 70s by Hans Berliner with focus on smooth evaluation, and by Gerald Tesauro from the late 80s, who successfully applied Neural Networks and Temporal Difference Learning to his Backgammon playing programs. Computer backgammon is regularly played at Computer Olympiads, organized by the ICGA ^[2].
A Backgammon Set ^[3]

Computer Olympiads

Photos

18th Computer Olympiad 2015, Backgammon medalists: Frank Berger (Bronze for BGBlitz),
Nikolaos Papahristou (Gold for Palamedes), and Nardy Pillards (Silver for GNU Backgammon) ^[4]

Evaluation

In the late 70s at Carnegie-Mellon University, Hans Berliner developed the Backgammon playing program BKG 9.8 for the PDP-10 to research the principles of evaluation for another game than chess with a much higher branching factor of more than 800 at every node ^[5]. Early versions of BKG played badly even against weak players, but Berliner noticed that its critical mistakes were always at transitions apparently due to evaluation discontinuity. He applied principles of fuzzy logic to smooth out the transition between phases, and by July 1979, BKG 9.8 was strong enough to play against the ruling world champion Luigi Villa. It won the match 7–1, becoming the first computer program to defeat a world champion in any game. Berliner states that the victory was largely a matter of luck, as the computer received more favorable dice rolls ^[6] ^[7].

Learning

In the late 80s, IBM researcher Gerald Tesauro pioneered in applying Neural Networks to Backgammon - first within his program Neurogammon, which won the Gold medal at the 1st Computer Olympiad 1989 - and further improved by TD-Lambda based Temporal Difference Learning within TD-Gammon ^[8].

Publications

1977 ...

Hans Berliner (1977). BKG - A Program that Plays Backgammon. Technical Report, Carnegie Mellon University
Hans Berliner (1977). Experiences in Evaluation with BKG, a Program That Plays Backgammon. IJCAI, 1977, hosted by Backgammon Galore
Hans Berliner (1979). On the Construction of Evaluation Functions for Large Domains. IJCAI 1979, Vol. 1, hosted by Backgammon Galore
Editor (1979). Computer Backgammon. Personal Computing, Vol. 3, No. 8, pp. 81

1980 ...

Hans Berliner (1980). Backgammon Computer Program Beats World Champion. Artificial Intelligence, Vol. 14, hosted by Backgammon Galore
Hans Berliner (1980). Computer Backgammon. Scientific American, Vol. 242, No. 6, hosted by Backgammon Galore

1985 ...

Gerald Tesauro, Terrence J. Sejnowski (1987). A 'Neural' Network that Learns to Play Backgammon. NIPS 1987
Gerald Tesauro (1988). Connectionist Learning of Expert Backgammon Evaluations. ML, 1988
Gerald Tesauro (1988). Neural network defeats creator in backgammon match. Technical report no. CCSR-88-6, Center for Complex Systems Research, University of Illinois at Urbana-Champaign
Gerald Tesauro (1989). NEUROGAMMON: A Neural-Network Backgammon Learning Program. Heuristic Programming in Artificial Intelligence 1
Gerald Tesauro (1989). Neurogammon Wins Computer Olympiad. Neural Computation Vol. 1, No. 3
Gerald Tesauro, Terrence J. Sejnowski (1989). A Parallel Network that Learns to Play Backgammon. Artificial Intelligence, Vol. 39, No. 3

1990 ...

Gerald Tesauro (1992). Temporal Difference Learning of Backgammon Strategy. ML 1992
Justin A. Boyan (1992). Modular Neural Networks for Learning Context-Dependent Game Strategies. Master's thesis, University of Cambridge, pdf
Gerald Tesauro (1994). TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play. Neural Computation Vol. 6, No. 2

1995 ...

Gerald Tesauro (1995). Temporal Difference Learning and TD-Gammon. Communications of the ACM, Vol. 38, No. 3
Michael Buro (1999). Efficient Approximation of Backgammon Race Equities. ICCA Journal, Vol 22, No. 3,pdf

2000 ...

Michael Buro (2001). Efficient Approximation of Backgammon Race Equities. Advances in Computer Games 9, pdf
Gerald Tesauro (2002). Programming backgammon using self-teaching neural nets. Artificial Intelligence Vol. 134 No. 1-2
Frank Berger (2002). BGBlitz wins Backgammon tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Frank Berger (2002). Backgammon at the 7th Computer Olympiad. ICGA Journal, Vol. 25, No. 4 » 7th Computer Olympiad
Frank Berger (2003). BGBlitz wins Backgammon tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad
Thomas Hauk, Michael Buro, Jonathan Schaeffer (2004). *-Minimax Performance in Backgammon. CG 2004

2005 ...

Frank Berger (2006). GnuBG wins Backgammon tournament. ICGA Journal, Vol. 29, No. 3 » 11th Computer Olympiad
François van Lishout, Guillaume Chaslot, Jos Uiterwijk (2007). Monte-Carlo Tree Search in Backgammon. CGW 2007
Frank Berger (2007). BGBlitz wins Backgammon tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
Wee Chong Oon, Martin Henz (2007). M2ICAL Analyses HC-Gammon. AAAI 2007 ^[9]

2010 ...

Marco Wiering (2010). Self-play and using an expert to learn to play backgammon with temporal difference learning. Journal of Intelligent Learning Systems and Applications, Vol. 2, No. 2
Nikolaos Papahristou, Ioannis Refanidis (2011). Training Neural Networks to Play Backgammon Variants Using Reinforcement Learning. Proceedings of Evogames 2011, Part I, LNCS 6624, pdf
Nikolaos Papahristou, Ioannis Refanidis (2011). Improving Temporal Difference Performance in Backgammon Variants. Advances in Computer Games 13, pdf
Frank Berger (2012). Palamedes wins Backgammon Tournament. ICGA Journal, Vol. 35, No. 1 » 16th Computer Olympiad
Nikolaos Papahristou, Ioannis Refanidis (2013). AnyGammon: Playing backgammon variants using any board size. FDG-2013, pdf

2015 ...

Nikolaos Papahristou, Ioannis Refanidis (2015). Constructing Pin Endgame Databases for the Backgammon Variant Plakoto. Advances in Computer Games 14 ^[10]

Forum Posts

Chess, Backgammon and Neural Nets (NN) by Torsten Schoop, CCC, August 20, 1998
Neural nets in backgammon by Albert Silver, CCC, April 07, 2004
A SNAC, anyone? by Jan Brouwer, CCC, July 30, 2007
What is the best backgammon software? by M. Ansari, CCC, October 15, 2008
Backgammon is not chess! by Joe Russell, BGonline.org Forums, March 08, 2013

External Links

Computer Backgammon

Backgammon (ICGA Tournaments)
Backgammon Articles: Using Computers to Improve Your Game hosted by the Backgammon Galore
the neural net backgammon programs from Machine Learning in Games by Jay Scott
Neural Network learns Backgammon by Kimon Tsinteris and David Wilson
FIBS, the First Internet Backgammon Server

Backgammon Programs

References

^ Backgammon Galore
^ Backgammon (ICGA Tournaments)
^ A backgammon set, consisting of a board, two sets of 15 checkers, two pairs of dice, a doubling cube, and dice cups, Image by Ptkfgs, March 6, 2013, Backgammon from Wikipedia, Wikimedia Commons
^ 18th Computer Olympiad - Day 6 Photos by Jan Krabbenbos
^ Hans Berliner (1977). Experiences in Evaluation with BKG, a Program That Plays Backgammon. IJCAI, 1977, hosted by Backgammon Galore
^ Hans Berliner from Wikipedia
^ Hans Berliner (1980). Backgammon Computer Program Beats World Champion. Artificial Intelligence, Vol. 14
^ Richard Sutton, Andrew Barto (1998). Reinforcement Learning: An Introduction. MIT Press, 11.1 TD-Gammon
^ The hillclimbing HC-Gammon from Machine Learning in Games by Jay Scott
^ Plakoto from Wikipedia

What links here?

Page	Date Edited
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
16th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
4th Computer Olympiad	Jul 15, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
AI Factory	Dec 26, 2015
Alan Frank	Dec 19, 2016
Arleen Chafitz	Jun 5, 2017
Automated Tuning	Feb 27, 2018
Backgammon	Dec 22, 2017
Chafitz	Dec 25, 2017
Frank Berger	Jan 16, 2017
Games	Feb 20, 2018
Gerald Tesauro	Dec 13, 2016
Guillaume Chaslot	Jan 2, 2017
Hans Berliner	Jun 10, 2017
ICD Corporation	Feb 25, 2014
ICGA Journal	Dec 21, 2017
Ioannis Refanidis	Jan 19, 2016
Jean-Luc Seret	Jan 7, 2016
Justin A. Boyan	Jan 10, 2017
Klaus-Uwe Koschnick	Jan 10, 2017
Martin Bryant	Dec 11, 2016
Nardy Pillards	Jan 10, 2017
Neural Networks	Mar 12, 2018
Nikolaos Papahristou	Jan 7, 2017
Personal Computing	Dec 27, 2017
Pseudorandom number generator	May 11, 2017
Randall Hoogerhyde	Jan 10, 2017
Reinforcement Learning	Feb 12, 2018
Steve Chafitz	Aug 2, 2013
Temporal Difference Learning	Feb 20, 2018
Terrence J. Sejnowski	Jan 24, 2017
Wee Chong Oon	Jul 16, 2015

Up one Level

Bao

GerdIsenberg — Fri, 23 Dec 2016 20:03:08 GMT

Home * Games * Bao

		Bao, a traditional mancala board game played in most of East Africa, most popular among the Swahili people of Tanzania, especially Zanzibar and Kenya. Bao is the swahili word for board or board game. ^[1] . Bao is a two-player abstract strategy game, and considered as one of the most complex mancala games. The Bao board has four rows of eight pits, each player owns two adjacent rows.
Initial setup in Bao la kiswahili ^[2]

Bao 0.1

See also

Selected Publications

Bao 0.1

Bao 0.1 is a Bao playing program by Jeroen Donkers running under Windows ^[3] :

Selected Publications

Thomas Hyde (1694). De Ludis Orientalibus (Libri Duo: Historia Nerdiludii), Oxford ^[4]

1978 ...

Philip Townshend (1978). Games of Strategy: A new Look at Correlates. The Association for the Anthropological Study of Play, Vol. 4, No. 4
Philip Townshend (1979). Anthropological perspectives on bao (mankala) games. Institute of African Studies, University of Nairobi, amazon

1980 ...

Philip Townshend (1982). Bao (mankala): the Swahili ethic in African idiom. Paideuma 28
Alex de Voogt (1995). Limits of the Mind: Towards a Characterisation of Bao Mastership. Ph.D. Thesis, CNWS Publications

2000 ...

Alex de Voogt (2002). Reproducing board game positions: Western Chess and African Bao. Swiss Journal of Psychology, Vol. 61, No. 4
Jeroen Donkers, Jos Uiterwijk, Alex de Voogt (2002). Mancala Games - Topics in Artificial Intelligence and Mathematics. Step by Step. Proceedings of the 4th Colloquium ‘Board Games in Academia’ (eds. Jean Retschitzki and Rosita Haddad-Zubel), Editions Universitaires, Fribourg, Switzerland, pp. 133–146.
Jeroen Donkers, Jos Uiterwijk (2002). Programming Bao. 7th Computer Olympiad Workshop, pdf
Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2003). Opponent Models in Bao: Conditions of a Successfull Application, Advances in Computer Games 10, pdf
Alex de Voogt (2003). Muyaka's poetry in the history of Bao. Bulletin of the School of Oriental and African Studies, Vol. 66, No. 1
Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2004). Probabilistic Opponent-Model Search in Bao. (M. Rauterberg, ed.) Proceedings International Conference on Entertainment Computing - ICEC 2004. LNCS 3166, Springer, Berlin. pp. 409-419. pdf

2005 ...

Tom Kronenburg, Jeroen Donkers, Alex de Voogt (2006). Never-Ending Moves in Bao. ICGA Journal, Vol. 29, No. 2, pdf

External Links

Bao (mancala game) from Wikipedia
Bao from Wikimanqala
Bao la kiswahili from Mancala World
Bao page by Jeroen Donkers
Zanzibar Bao Rules for the Computer
The Rules of Bao
Bao (Zanzibar) rules by Rob Nierse, The Game Cabinet
Bao (Malawi) rules related to Pete Duckworth by Mark Chikoko, transcribed by Adrian Brooks, The Game Cabinet
Bao as a research problem by David MacKay
Simon Phillips, Philippe Saisse, Pino Palladino - Mancala, Zoetermeer, November 15, 2009, YouTube Video

References

^ Bao (mancala game) from Wikipedia
^ Bao Board from Tanzania, Image by Nino Vessella, CC BY 3.0, Wikimedia Commons, Bao (mancala game) from Wikipedia
^ Bao page by Jeroen Donkers
^ De Ludis Orientalibus (Libri Duo: Historia Nerdiludii) from ot-tissimo - Ihr Auktionsportal

What links here?

Page	Date Edited
Alex de Voogt	Aug 9, 2014
Awari	Feb 14, 2017
Bao	Dec 23, 2016
Games	Feb 20, 2018
Jeroen Donkers	Dec 23, 2016
Jos Uiterwijk	Aug 11, 2017
Kalah	Dec 22, 2016

Up one Level

Breakthrough (Game)

GerdIsenberg — Fri, 11 Aug 2017 15:29:36 GMT

Solving Small Boards

Programming

See also

Selected Publications

External Links

References

What links here?

Home * Games * Breakthrough (Game)

Breakthrough,
an abstract strategy board game invented by Dan Troyka in 2000 ^[1] ^[2]. It can be played on various board sizes, most common on an 8x8 chessboard with initially 16 pawn like counters on its two back ranks. Counters may push one step straight or diagonally forward if the target square is empty, or capture one step diagonally if the target square is occupied by an opponent piece. The first player to reach the opponent's back rank or captures all opponent men wins the game ^[3].

Solving Small Boards

Abdallah Saffidine, Nicolas Jouandeau, and Tristan Cazenave applied race patterns and an extension of Job-level Proof-number search to solve Breakthrough on up to 6x5 boards ^[4].

Programming

As introduced at the Computer and Games 2013 conference in Yokohama, Richard J. Lorentz and Therese Horey used a hybrid version of Monte-Carlo Tree Search for Breakthrough ^[5]. Playouts are not complete games but fragments where a reliable evaluation function can be used at the stopping points ^[6].

Selected Publications

Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13, pdf
Stephan Schiffel (2011). Knowledge-Based General Game Playing. Ph.D. thesis, Dresden University of Technology, advisor Michael Thielscher and Yngvi Björnsson, pdf ^[7]
Richard J. Lorentz, Therese Horey (2013). Programming Breakthrough. CG 2013
Richard J. Lorentz, Andrew Isaac (2016). Using Partial Tablebases in Breakthrough. CG 2016
Richard J. Lorentz (2017). Machine Learning in the Game of Breakthrough. Advances in Computer Games 15

External Links

References

^ William Daniel Troyka - Mancala World
^ Breakthrough (board game) from Wikipedia
^ Image from Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13 - Fig. 1: Rules for the game
^ Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13, pdf
^ Richard J. Lorentz, Therese Horey (2013). Programming Breakthrough. CG 2013
^ Ingo Althöfer (2013). The wild Years are gone: Monte Carlo in Smoother Waters. Conference Report CG 2013, ICGA Journal, Vol. 36, No. 3
^ Appandix A. The Rules of Breakthrough - in Game Description Language

What links here?

Page	Date Edited
20th Computer Olympiad	Feb 5, 2018
Abdallah Saffidine	Aug 11, 2017
Advances in Computer Games 13	Jan 7, 2017
BreakThrough	Nov 26, 2016
Breakthrough (Game)	Aug 11, 2017
CG 2013	Jul 18, 2017
Games	Feb 20, 2018
Monte-Carlo Tree Search	Apr 26, 2018
Nicolas Jouandeau	Jun 29, 2017
Pattern Recognition	Sep 8, 2017
Pawns Breakthrough	May 4, 2014
Proof-number search	Jan 22, 2018
Richard J. Lorentz	Aug 11, 2017
Therese Horey	May 4, 2014
Tristan Cazenave	Jan 22, 2018
Zillions of Games	May 29, 2017

Up one Level

Checkers

GerdIsenberg — Sat, 23 Dec 2017 21:18:25 GMT

Home * Games * Checkers

		Checkers, also American Checkers or English draughts, is a variant of Draughts played on an eight by eight board using 32 either dark or light squares. Like Chess, Checkers is a two-player zero-sum and perfect information abstract strategy board game. Each side starts with twelve checkers, placed on the three back-ranks. Black moves first, alternating with White - there is no passing move. Checkers move one step diagonally forward, kings diagonally forward and backward. When a checker reaches the last rank, it promotes to a king. Checkers and king capture men by jumping over them to an empty square behind (checkers only forward). Captures are compulsory, one must play a capture if at least one is available, and is required to continue jumping and capturing as part of the same turn. However, a checker reaching the last row must stop to be crowned and can move no further on that turn ^[1]. The side run out of moves loses.
Checkers board ^[2]

Computer Olympiads

Solving Checkers

In 2007, the Chinook team around Jonathan Schaeffer declared Checkers solved ^[3] ^[4] ^[5].

Programs

The first Checkers program was written by Christopher Strachey, National Research Development Corporation, London, in the early 1950s to run on a Pilot ACE at the National Physical Laboratory, exhausting its memory ^[6], and soon ported to the Ferranti Mark 1 ^[7] ^[8]. His checkers program from 1966 ^[9] written in CPL is available on-line, in a corrected version with courtesy of Peter Norvig ^[10] ^[11]. The second program was written in 1956 by Arthur Samuel ^[12]:

American checkers

Cake by Martin Fierz
Checker! by Gil Dodgen
Checker Hustler by Derek Oldbury
Checkermate by Derek Oldbury and Adrian Millett
Checkers from AI Factory
Chinook by Jonathan Schaeffer et al. ^[13]
Colossus Draughts by Martin Bryant
The Duke program by Eric Jensen, Tom Truscott and Alan Biermann
KingsRow by Ed Gilbert
Nemesis by Murray Cash
Sage Draughts by Adrian Millett
Tournament Checkers by David Butler
Wyllie by Roberto Waldteufel

Classical checkers

Profound by Alvaro Cardoso
Windamas by Jean-Bernard Alemanni

Selected Publications

1952 ...

Christopher Strachey (1952). Logical or non-mathematical Programs. Proceedings of the ACM Conference, Toronto, reprinted in David Levy (ed.) (1988). Computer Games I.
Arthur Samuel (1959). Some Studies in Machine Learning Using the Game of Checkers. IBM Journal July 1959, reprinted in David Levy (ed.) (1988). Computer Games I. ^[14]

1960 ...

Arnold K. Griffith (1966). A new Machine-Learning Technique applied to the Game of Checkers. MIT, Project MAC, MAC-M-293
Christopher Strachey (1966). System Analysis and Programming. Scientific American, September 1966, re-published August 23, 2011
Arthur Samuel (1967). Some Studies in Machine Learning. Using the Game of Checkers. II-Recent Progress. pdf

1970 ...

Arnold K. Griffith (1974). A Comparison and Evaluation of Three Machine Learning Procedures as Applied to the Game of Checkers. Artificial Intelligence, Vol. 5, No. 2
Aviezri Fraenkel, Michael R. Garey, David S. Johnson, Thomas J. Schaefer, Yaacov Yesha (1978). The Complexity of Checkers on an N * N Board. FOCS 1978
Tom Truscott (1978). Computer-Checkers. Personal Computing, Vol. 2, No. 9, pp. 86
Editor (1979). Computer Checkers. Personal Computing, Vol. 3, No. 2, pp. 73
Editor (1979). Computer Checkers. Personal Computing, Vol. 3, No. 4, pp. 70
Editor (1979). Computer Checkers - A Checkers Program. Personal Computing, Vol. 3, No. 5, pp. 60
Editor (1979). Computer Checkers - The Tinsely Challange. Personal Computing, Vol. 3, No. 7, pp. 88

1980 ...

Editor (1980). A Checkers Debate. Personal Computing, Vol. 4, No. 5, pp. 83 » Martin Gardner

1990 ...

Jonathan Schaeffer (1991). Checkers, a Preview of what will Happen in Chess? ICCA Journal, Vol. 14, No. 2
Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1991). Checkers Program to Challenge for World Championship. SIGART Bulletin, Vol. 2, No. 2
Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1991). Reviving the Game of Checkers. Heuristic Programming in AI 2
Jonathan Schaeffer, Norman Treloar, Paul Lu, Rob Lake (1993). Man Versus Machine for the World Checkers Championship. AI Magazine, Vol. 14, No. 2 » WCCC 1992 - Workshop ^[15]
Jonathan Schaeffer, Norman Treloar, Paul Lu, Rob Lake (1993). Man Versus Machine for the World Checkers Championship. ICCA Journal, Vol. 16, No. 2

1995 ...

Jonathan Schaeffer, Rob Lake (1996). Solving the Game of Checkers. Games of No Chance edited by Richard J. Nowakowski, pdf
J. Ignacio Giráldez, Daniel Borrajo (1998). Distributed Decision Making in Checkers. CG 1998
Kumar Chellapilla, David B. Fogel (1999). Evolving Neural Networks to Play Checkers without Expert Knowledge. IEEE Transactions on Neural Networks, Vol. 10, No. 6, pp. 1382-1391.

2000 ...

Kumar Chellapilla, David B. Fogel (2001). Evolving an Expert Checkers Playing Program without Using Human Expertise. IEEE Transactions on Evolutionary Computation, Vol. 5, No. 4, pp.422-428
Jonathan Schaeffer (2001). Technology Transfer from One High-Performance Search Engine to Another. ICGA Journal, Vol. 24, No. 3
David B. Fogel (2002). Blondie24: Playing at the Edge of AI. Morgan Kaufmann Publishers, Inc., San Francisco, CA. ISBN 1-55860-783-8, amazon.com ^[16]
Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Rob Lake, Paul Lu, Steve Sutphen (2003). Building the Checkers 10-Piece Endgame Databases. Advances in Computer Games 10. pdf » Endgame Tablebases
Ed Trice, Gil Dodgen (2003). The Perfect 7-Piece Checkers Database. ICGA Journal, Vol. 26, No. 4 » Endgame Tablebases

2005 ...

Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2005). Solving Checkers. IJCAI 2005
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
Magdalena Kusiak, Karol Walędzik, Jacek Mańdziuk (2007). Evolutionary Approach to the Game of Checkers. 8. ICANNGA, pdf
Jonathan Schaeffer (1997, 2009). One Jump Ahead Challenging Human Supremacy in Checkers. Springer, ISBN 0-387-94930-5, ISBN 978-0-387-76575-4
Belal Al-Khateeb, Graham Kendall (2009). Introducing a round robin tournament into Blondie24. CIG 2009

2010 ...

Karol Walędzik, Jacek Mańdziuk (2010). The Layered Learning method and its Application to Generation of Evaluation Functions for the Game of Checkers. 11. PPSN, pdf
João Guerra (2011). Classical Checkers. Masters thesis, Technical University of Lisbon, pdf
Aart Bik (2012). Computing Deep Perft and Divide Numbers for Checkers. ICGA Journal, Vol. 35, No. 4 » Perft
Belal Al-Khateeb, Graham Kendall (2012). Effect of Look-Ahead Depth in Evolutionary Checkers. Journal of Computer Science and Technology, Vol. 27, No. 5
Danilo Carvalho, Minh Le Nguyen, Hiroyuki Iida (2017). An Analysis of Majority Voting in Homogeneous Groups for Checkers: Understanding Group Performance through Unbalance. Advances in Computer Games 15, ResearchGate

Forum Posts

1990 ...

A taste of things to come? by Jonathan Schaeffer, rgc, September 01, 1990
Checkers match by Murray Campbell, rgc, August 20, 1992
Man vs. Machine World Checkers Championship (day 5) by Robert Lake, rgc, August 21, 1992
Tinsley vs. Chinook? by Robert Williams, rgc, August 16, 1994
Silicon Graphics World Checkers Championship by Robert Lake, rgc, August 16, 1994
Silicon Graphics World Checkers Championship - day 3 by Jonathan Schaeffer, rgc, August 18, 1994
Checkers Championship - additional information by Jonathan Schaeffer, rgc, August 20, 1994
PDN - Portable Draughts Notation by Pc Sol, rgc, July 22, 1995

2000 ...

perft for 8x8 checkers by Aart Bik, CCC, May 08, 2009 » Perft

2010 ...

WinBoard, exotic version by Harm Geert Muller, CCC, January 15, 2011 » WinBoard
UCT surprise for checkers ! by Daniel Shawul, CCC, March 25, 2011
Checkers Is Strongly-Solved for 8-pieces by Ed Trice, CCC, February 12, 2017
Checkers Bitboard representation by Pranav Deshpande, CCC, July 02, 2017 » Bitboards

External Links

References

^ Mr. Fred Investments | CheckerMaven / RulesOfCheckers
^ Checkers (English draughts) from Wikipedia
^ 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 (5844). Work named by Science Magazine as one of the 10 most important scientific achievements of 2007
^ Checkers Is Solved
^ Chinook - Solving Checkers
^ Christopher Strachey from Wikipedia
^ artificial intelligence (AI) :: Early milestones in AI from Britannica Online Encyclopedia
^ Christopher Strachey (1952). Logical or non-mathematical programmes. Proceedings of the 1952 ACM national meeting
^ Christopher Strachey (1966). System Analysis and Programming. Scientific American, September 1966, republished August 23, 2011
^ Complete Annotated Strachey Checkers Program by Peter Norvig
^ Prescient but Not Perfect: A Look Back at a 1966 Scientific American Article on Systems Analysis by Peter Norvig, August 23, 2011
^ English draughts - Computer players from Wikipedia
^ Chinook - Solving Checkers
^ Some studies in machine learning using the game of checkers by Arthur Lee Samuel from Jeremy Norman's Historyofscience.com - Used Book - Paperback - First Edition
^ Marion Tinsley vs. Chinook - Wikipedia
^ Blondie24 by David B. Fogel, Book Review, © Copyright 2003, Jim Loy
^ perft for 8x8 checkers by Aart Bik, CCC, May 08, 2009

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
4th Computer Olympiad	Jul 15, 2017
A. Harry Klopf	Dec 29, 2017
Aart Bik	Mar 1, 2018
Adrian Millett	Jul 12, 2017
AI Factory	Dec 26, 2015
Akihiro Kishimoto	Jan 22, 2018
Alan Biermann	Dec 21, 2017
Álvaro Begué	Feb 27, 2018
Alvaro Cardoso	Jan 12, 2018
Amazons	Aug 12, 2017
APHID	Jun 26, 2017
Arnold K. Griffith	Oct 4, 2015
Arthur Samuel	May 29, 2016
Automated Tuning	Feb 27, 2018
Barney Pell	Jul 21, 2017
Bart Verbaan	Nov 3, 2015
Bitboards	Nov 14, 2017
Chafitz	Dec 25, 2017
Chafitz Modular Game System	Dec 25, 2017
Checkers	Dec 23, 2017
Christopher Strachey	May 8, 2017
Daniel Shawul	Jan 28, 2018
David B. Fogel	May 23, 2016
Depth	Feb 25, 2018
Derek Oldbury	Jul 12, 2017
Draughts	Jul 12, 2017
Duane Szafron	Feb 20, 2018
Ed Trice	Feb 21, 2018
Edward John Quigley	Apr 27, 2012
Endgame Tablebases	Mar 6, 2018
Enhanced Transposition Cutoff	May 19, 2017
Eric Jensen	Jan 7, 2016
Ferranti Mark 1	Jun 2, 2015
Fidelity Electronics	Dec 1, 2017
Frédéric Prost	Oct 16, 2014
Games	Feb 20, 2018
General Game Playing	Dec 22, 2017
Gil Dodgen	Mar 1, 2017
Graham Kendall	May 26, 2015
Great Game Machine	Dec 20, 2017
Harm Geert Muller	Mar 31, 2018
History Heuristic	Jul 19, 2017
ICGA Journal	Dec 21, 2017
Igor Korshunov	May 16, 2016
Intelligent Software	Dec 11, 2012
Joe Culberson	Dec 13, 2016
Jonathan Kreuzer	Sep 16, 2017
Jonathan Schaeffer	Jan 29, 2018
José Manuel Morán	Jun 3, 2017
Kumar Chellapilla	May 23, 2016
L. Stephen Coles	Jan 5, 2017
Learning	Feb 20, 2018
Martin Bryant	Dec 11, 2016
Martin Fierz	Apr 26, 2018
Martin Müller	Aug 12, 2017
Mathematician	Apr 9, 2018
Mehdi Mhalla	Apr 25, 2014
Monte-Carlo Tree Search	Apr 26, 2018
Murray Campbell	Jun 2, 2017
Nebiyu	Dec 10, 2017
Neil Burch	Jan 10, 2018
Nine Men’s Morris	Dec 17, 2016
Norman Treloar	Dec 17, 2016
Null Window	Nov 8, 2016
Paul Lu	Dec 13, 2016
Perft	Sep 26, 2017
Persistent Hash Table	Dec 31, 2017
Personal Computing	Dec 27, 2017
Peter Norvig	Jun 7, 2016
Principal Variation Search	Oct 22, 2017
ProbCut	Mar 25, 2016
Proof-number search	Jan 22, 2018
Rein Halbersma	Dec 22, 2015
Retrograde Analysis	Mar 21, 2017
Rob Lake	Dec 5, 2016
Roberto Waldteufel	Jun 5, 2013
Scorpio	Mar 28, 2018
Stef Keetman	Jan 13, 2017
Teerapong Tovirat	Oct 21, 2014
Temporal Difference Learning	Feb 20, 2018
Thomas Lincke	Dec 22, 2016
Timothy J. Hays	May 23, 2016
Tom Truscott	Dec 22, 2017
Yngvi Björnsson	Jun 26, 2017
Zillions of Games	May 29, 2017

Up one Level

Chess960

GerdIsenberg — Tue, 27 Sep 2016 13:27:25 GMT

Home * Games * Chess960

Chess960, (or Fischer Random Chess)
a chess variant invented by former World Chess Champion Bobby Fischer, introduced on June 19, 1996 in Buenos Aires, Argentina ^[1] . Randomizing the pieces on its back rank has been known as Shuffle Chess, but Chess960 introduces rules so that castling options are retained in all starting positions, one player's bishops must start on opposite-color squares, and the king must start on a square between the rooks, resulting in 960 unique positions, while the classical initial position is one of them. Chess960 practically handicaps the application of opening theory in classical chess with the memorization of opening moves, both for human as well for chess programs.

Publications

Reinhard Scharnagl (2004). Fischer-Random-Schach: (FRC/Chess 960). Books on Demand, ISBN: 3833413220, 9783833413223 (German)

Forum Posts

2005 ...

Chess960 Nullmove castling by Gian-Carlo Pascutto, CCC, August 01, 2005
Chess960: Arena castle vs X-FEN castle by Matthias Gemuh, CCC, November 05, 2005
Chess960 in Fritz9GUI and Winboard_frc by Matthias Gemuh, CCC, November 24, 2005
supporting FRC questions by Uri Blass, Winboard Forum, September 13, 2006

2010 ...

FRC / Chess960 Engine with "Divided" Command by Steve Maughan, CCC, December 02, 2014 » Perft

2015 ...

Some Chess960/FRC positions to be confirmed by Reinhard Scharnagl, CCC, February 09, 2015 » Perft Results

External Links

References

^ The birth of Fischer Random Chess by Eric van Reem

What links here?

Page	Date Edited
AICE	Nov 29, 2017
Alexander Schmidt	May 17, 2016
Anaconda	Jul 4, 2015
Anastasios Milikas	Nov 29, 2017
Arena	Mar 16, 2018
Ayito	Apr 6, 2013
Betsy	Jul 28, 2014
BigLion	Sep 28, 2016
Carballo	Oct 2, 2016
Castling	May 5, 2017
Castling rights	Jan 7, 2017
CCRL	Dec 13, 2017
Cheese	Feb 17, 2018
Cheng	Jul 30, 2017
Chess	Jan 21, 2018
Chess960	Sep 27, 2016
Chess960 Engines	Feb 13, 2014
Chess960CWC 2005	Jan 1, 2016
Chess960CWC 2006	Sep 25, 2014
Chess960CWC 2007	Aug 21, 2012
Chess960CWC 2008	Aug 21, 2012
Chess960CWC 2009	Aug 21, 2012
ChessGUI	Jan 17, 2018
ChessV	Jan 21, 2018
Chiron	Sep 24, 2017
Chispa	Feb 13, 2014
Critter	Jan 25, 2014
DanaSah	Oct 9, 2017
DayDreamer	Aug 22, 2016
Demolito	Mar 1, 2018
Dictionary	Aug 24, 2017
DirGolem	Jun 5, 2016
DiscoCheck	Jun 23, 2017
Ed Northam	Sep 4, 2016
Encoding Moves	Mar 27, 2016
Entering Moves	Sep 7, 2017
Eric van Reem	Sep 10, 2014
Federico Andrés Corigliano	Feb 13, 2014
Fire	Oct 12, 2017
Frenzee	Feb 24, 2013
Fridolin	Jun 27, 2017
Galjoen	Mar 19, 2018
Games	Feb 20, 2018
Glaurung	Mar 14, 2017
Hamsters	Apr 11, 2014
Hans-Walter Schmitt	Sep 10, 2014
Hermann	Dec 7, 2017
Homer	Dec 23, 2013
Hussar	Mar 27, 2016
Ikarus	Jul 5, 2016
Initial Position	Apr 14, 2018
Ivanhoe	Aug 3, 2015
Jonathan Warkentin	Jun 29, 2014
Jonny	Nov 4, 2017
Jose	Feb 26, 2015
Kees de Kruif	Nov 9, 2015
Komodo	Mar 6, 2018
Kurt	Apr 20, 2014
Legal Move	Feb 16, 2017
List (Program)	Jan 7, 2016
LittleBlitzer	Jan 24, 2017
LittleThought	Nov 7, 2016
Livingston Chess960 Computer World Championship	Aug 7, 2012
Matthias Gemuh	Jan 21, 2018
Nebula	Feb 7, 2015
Nemorino	Dec 21, 2017
Patzer	Apr 5, 2017
Perft	Sep 26, 2017
Perft Results	Feb 10, 2018
Pharaon	Sep 2, 2017
Pulsar	May 4, 2017
PyChess	Dec 28, 2017
Ramjet	Sep 27, 2017
Reinhard Scharnagl	Apr 9, 2016
Ryan Benitez	May 16, 2015
Scidb	Mar 18, 2018
Senpai	Nov 10, 2017
Sjaak (Glebbeek)	Oct 4, 2017
Smirf	Apr 10, 2016
Spike	Jan 7, 2016
Stockfish	Apr 7, 2018
Sune Fischer	Apr 7, 2014
Taktix	Sep 28, 2016
Teki	Mar 29, 2018
The Baron	Jan 8, 2018
Tornado	Dec 14, 2017
Ufim	Mar 22, 2014

Up one Level

Chinese Chess

GerdIsenberg — Tue, 16 Jan 2018 08:30:10 GMT

Home * Games * Chinese Chess

		Chinese Chess, or Xiangqi 象棋 ^[1], is a version of chess very popular in east Asia. The rules are analogues to international chess. The Chinese Chess set includes a board and 32 pieces for two players. The board has ten horizontal lines called ranks and nine vertical lines called files. In the middle of the board the central seven files are interrupted by a horizontal space called the “River”, which splits the board into two parts. Each side of the board has a “Palace” a 3x3 area in the central base. The seven kind of pieces are placed on the intersections and move and capture according to their individual ability and restriction along the lines including the “River banks”. The two sides are usually distinguished by color, being red or black ^[2] . The object of the game is to checkmate or stalemate (is a win as well) the opponent King aka General. However, partly due to the freedom and power of the Rook over other pieces, and the limited freedom of the General, it is forbidden to repeat perpetually a direct thread (i.e. perpetual check 長將, perpetual thread of capture 長捉, a check and then a threat of mate 一將一殺, or a combination of these). This needs to be taken into account in the board representation.
Xiangqi board, with pieces in their starting positions ^[3]

Computer Chinese Chess

References

What links here?

Pieces

Pieces on the red side bear different characters than their counterparts on the black side. They are the same pieces, but names on the Red side are subtly more noble than those on the Black side ^[4].

Name		Notation ^[5]	Value ^[6]	Movement	Restriction
帥、將	King (General)	K		moves and captures one orthogonal step	may not leave the palace The two kings may not face each other along the same file with no intervening piece
仕, 士	Advisor (Guard)	A	2	moves and captures one diagonal step	may not leave the palace
相、象	Elephant	E	2	moves and captures two diagonal points	may not jump over intervening pieces,may not cross the river
傌, 馬	Horse	H	4	moves and captures one orthogonal step plus one diagonal step	blocked by orthogonal adjacent pieces
俥, 車	Rook (ChaRiot)	R	9	moves and captures any distance orthogonally	may not jump over intervening pieces
炮, 炮	Cannon	C	4½	moves any distance orthogonally - captures by jumping a single piece, friend or foe, in-between the orthogonal path of attack towards the captured piece
兵、卒	Pawn (Soldier)	P (S)	1 2	moves and captures one step forward - once crossed the river, also one point sideways

Xiangqi Engines

To expand this list, create a new Chinese Chess aka Xiangqi engine page with the tag "Xiangqi".

1. Abyss
2. Chimo
3. HaQiKi D
4. Shiga
5. Sjaak (Glebbeek)
6. Xian
7. XieXie
8. Zillions of Games

Computer Olympiads

Photos



Xiangqi winners in Graz 2003, Pascal Tang, Zhi-Jian Tu and Shun-Chin Hsu ^[7]

Xiangqi winners Taipei 2005 with TD Jaap van den Herik and representative of the sponsor Acer Inc., Mingyang Zhao (Gold), Ming-Cheng Cheng (Silver) and Jiao Wang (Bronze) ^[8]


Yokohama 2013, Wen-Jie Tseng, Shi-Jim Yen, Harm Geert Muller and Jaap van den Herik ^[9]

Publications

1981 ...

Y.T. Zhang (1981). Application of Artificial Intelligence in Computer Chinese Chess. M.Sc. thesis, Department of Electrical Engineering, National Taiwan University (Chinese)
Shun-Chin Hsu, D.H. Huang (1985). Design and Implementation of a Chinese Chess Knowledge Base. Proceedings of NCS, pp. 505-509. (Chinese)
Robert Nisonoff, M. Stephanie Ricks (1988). To Catch a King: East Meets West in the Game of Chess. PC Magazine, October 31, 1988, pp. 506 » EGA Chess, Xian
Nick Jacobs (1989). Xian, a Chinese Chess Program. Heuristic Programming in AI 1

1990 ...

Shun-Chin Hsu (1990). Introduction to Computer Chess and Computer Chinese Chess. Journal of Computer, Vol. 2, No. 2, pp. 1-8. (in Chinese)
Kuo-Ming Tsao, Jen-Hsuan Li, Shun-Chin Hsu (1991). Design and Implementation of a Chinese Chess Program. Heuristic Programming in AI 2
Shun-Chin Hsu, Kuo-Ming Tsao (1991). Design and Implementation of an Opening Game Knowledge-Base System for Computer Chinese Chess. Bulletin of the College of Engineering, N.T.U., No. 53, pp. 75-86. (in Chinese)
Chun Ye (1992). Experiments in Selective Search Extensions. MSc. thesis, Department of Computing Science, University of Alberta, pdf
Chun Ye, Tony Marsland (1992). Experiments in Forward Pruning with Limited Extensions. ICCA Journal, Vol. 15, No. 2, pdf
Chun Ye, Tony Marsland (1992). Selective Extensions in Game-Tree Search. Heuristic Programming in AI 3, pdf
Yi-Fan Ke, Tai-Ming Parng (1993). The Guard Heuristic: Legal Move Ordering with Forward Game-Tree Pruning. ICCA Journal, Vol. 16, No. 2
Mei-En Chen, Yo-Ping Huang (1995). Guard heuristic by dynamic fuzzy reasoning model for Chinese chess. Proceedings of ISUMA-NAFIPS '95

2000 ...

Jr-Chang Chen, Shun-Chin Hsu (2001). ELP wins Chinese Chess tournament. ICGA Journal, Vol. 24, No. 3 » 6th Computer Olympiad
Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2001). Construction of Chinese Chess Endgame Databases by Retrograde Analysis. CG 2000

2002

Ren Wu, Don Beal (2002). A memory efficient retrograde algorithm and its application to solve Chinese Chess endgames. More Games of No Chance edited by Richard J. Nowakowski
Jr-Chang Chen, Shi-Jim Yen, Shun-Chin Hsu (2002). ELP wins Chinese Chess tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2002). Indefinite Sequence of Moves in Chinese Chess Endgames. CG 2002

2003

Jr-Chang Chen, Shi-Jim Yen, Shun-Chin Hsu (2003). ZMBL wins Chinese Chess tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad

2004

Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2004). Checking Indefinitely in Chinese-Chess Endgames. ICGA Journal, Vol. 27, No. 1
Shi-Jim Yen, Jr-Chang Chen, Tai-Ning Yang, Shun-Chin Hsu (2004). Computer Chinese Chess. ICGA Journal, Vol. 27, No. 1, pdf
Haw-ren Fang (2004). Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases. CG 2004
Kuang-Che Wu, Tsan-Sheng Hsu, Shun-Chin Hsu (2004). Contemplation wins Chinese Chess tournament. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad

2005 ...

Haw-ren Fang (2005). The Nature of Retrograde Analysis for Chinese Chess, Part I. ICGA Journal, Vol. 28, No. 2
Haw-ren Fang (2005). Nature of Retrograde Analysis for Chinese Chess, Part II. ICGA Journal, Vol. 28, No. 3
Jr-Chang Chen, Shi-Jim Yen, Shun-Chin Hsu (2005). XQMaster wins Chinese Chess tournament. ICGA Journal, Vol. 28, No. 3 » 10th Computer Olympiad

2006

Kuang-Che Wu, Shun-Chin Hsu, Tsan-sheng Hsu (2006). The Graph-History Interaction Problem in Chinese Chess. Advances in Computer Games 11
Xinhe Xu (2006). Principle and Methodology of Computer Games of Chinese Chess. ISDA 2006
Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2008). Abstracting Knowledge from Annotated Chinese-Chess Game Records. CG 2006
Shi-Jim Yen, Shun-Chin Hsu (2006). NEUChess wins Chinese Chess tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Chun-Bin Hsu (2006). Pattern Recognition in Chinese Chess. Master thesis, National Chiao Tung University, pdf (Chinese)

2007

Changming Xu (2007). NEUChess wins Chinese Chess tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
Chin Soon Ong, Hanyang Quek, Kay Chen Tan, Arthur Tay (2007). Discovering Chinese Chess Strategies through Coevolutionary Approaches. IEEE Symposium on Computational Intelligence and Games, pdf

2008

Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2008). Knowledge Inferencing on Chinese Chess Endgames. CG 2008
Jiao Wang, Xinhe Xu (2008). Intella wins Chinese Chess tournament. ICGA Journal, Vol. 31, No. 3 » 13th Computer Olympiad

2009

Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2009). Conflict Resolution of Chinese Chess Endgame Knowledge Base. Advances in Computer Games 12, pdf
Guofeng Tong, Ying Qu, Tong Cheng (2009). Human-computer interactive gaming system - a chinese chess robot. IROS 2009, pp. 984-987 » Robots
Jr-Chang Chen, Bo-Nian Chen, Tsan-sheng Hsu (2009). TMSK wins the Chinese-Chess tournament. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
Wei-Lun Kao (2009). The Automatically Tuning System of Evaluation Function for Computer Chinese Chess. Master thesis, National Chiao Tung University, pdf (Chinese)

2010 ...

Jiao Wang, Si-Zhong Li, Xin-He Xu (2010). A Minors Hash Table in Chinese-Chess Programs. ICGA Journal, Vol. 33, No. 1
Bo-Nian Chen, Bing-Jie Shen, Tsan-sheng Hsu (2010). Chinese Dark Chess. ICGA Journal, Vol. 33, No. 2
Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2010). Knowledge Abstraction in Chinese Chess Endgame Databases. CG 2010

2011

Jr-Hung Guo, Kuo-Lan Su, Sheng-Ven Shiau (2011). Path Searching Algorithms of Multiple Robot System Applying in Chinese Chess Game. Recent Advances in Mobile Robotics, Dr. Andon Topalov (Ed.), ISBN: 978-953-307-909-7, pdf » Robots

2013

Wen-Jie Tseng, Jr-Chang Chen, I-Chen Wu, Ching-Hua Kuo, Bo-Han Lin (2013). A Supervised Learning Method for Chinese Chess Programs. JSAI2013, pdf
Jr-Chang Chen, Shi-Jim Yen, Tsan-Cheng Su (2013). SHIGA Wins Chinese Chess Tournament. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad
Bo-Nian Chen, Hung-Jui Chang, Shun-Chin Hsu, Jr-Chang Chen, Tsan-sheng Hsu (2013). Multilevel Inference in Chinese Chess Endgame Knowledge Bases. ICGA Journal, Vol. 36, No. 4 » Endgame Tablebases

2014

Bo-Nian Chen, Hung-Jui Chang, Shun-Chin Hsu, Jr-Chang Chen, Tsan-sheng Hsu (2014). Advanced Meta-knowledge for Chinese Chess Endgame Knowledge Bases. ICGA Journal, Vol 37, No. 1

2015 ...

Qiang Gao, Xinhe Xu (2015). Research on the Computational Complexity of n x n Chinese Chess. ICGA Journal, Vol. 38, No. 1
Pascal Tang (2015). SHIGA wins Chinese Chess Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad

Forum Posts

1994

rec.games.chinese-chess FAQ by Stephen Leary, rec.games.chinese-chess, January 04, 1994, also from chessvariants
Xiang Qi Is Not The Elephant Game by Stephen Leary, rec.games.chinese-chess, November 18, 1994
Machine vs. IGM in Chinese Chess by Ren Wu, CCC, July 13, 1999

2000 ...

Tony Marsland and Chinese Chess in Maastricht (slightly O.T.) by Omid David, CCC, July 30, 2002 » 7th Computer Olympiad, Maastricht 2002
Re: Tony Marsland and Chinese Chess in Maastricht (slightly O.T.) by Pham Hong Nguyen, CCC, July 30, 2002
Bitboard techniques in Xiangqi by Harm Geert Muller, CCC, February 12, 2009 » Bitboards
Computer Olympiad (XQ) by Harm Geert Muller, CCC, May 14, 2009 » 14th Computer Olympiad, Pamplona 2009
Kindergarten bitboards and Xiangqi move genaration? by Han Chengye, CCC, December 30, 2009 » Kindergarten Bitboards

2010 ...

Xiangqi evaluation function by Gregory Strong, CCC, July 09, 2010 » Evaluation
Xiangqi chase algorithm by Evert Glebbeek, CCC, November 16, 2011 » Sjaak
Interesting (Chinese) Chess variant by Harm Geert Muller, CCC, January 23, 2014
UCCI2WB by Harm Geert Muller, CCC, October 27, 2014 » Protocols
UCI protocol for chess variants by Evert Glebbeek, CCC, October 28, 2014 » UCI
Xiangqi chase - again by Evert Glebbeek, CCC, November 06, 2014 » Sjaak

2015 ...

Evaluation in Xiangqi by Harm Geert Muller, CCC, July 06, 2015
11-men tablebases (XQ) by Harm Geert Muller, CCC, May 23, 2016 » Endgame Tablebases
Xiangqi piece value model by Evert Glebbeek, CCC, May 29, 2016 » Point Value
Perft for Xiangqi & Shogi by Patrice Duhamel, CCC, June 12, 2016 » Shogi, Perft
Cumulative building of a shared search tree by Bojun Guo, CCC, December 28, 2016 » Opening Book, Persistent Hash Table
Probe EGT in quiescence? by Nguyen Pham, CCC, May 20, 2017 » Endgame Tablebases, Quiescence Search
A new design for Xianqgi (Chinese chess) Endgame Tablebase by Nguyen Pham, CCC, January 16, 2018 » Endgame Tablebases

External Links

Chinese Chess

World Xiangqi Federation
Xiangqi from Wikipedia
Xiangqi: Chinese Chess from The Chess Variant Pages
How to Play Xiangqi - Chinese Chess
Chinese Chess or Xiangqi from Chinasage
How XiangQi can improve your chess by Davide Nastasio, ChessBase, December 06, 2017
rec.games.chinese-chess

Computer Chinese Chess

ICGA: Chinese Chess
Chinese Chess at the Computer Olympiad
Computer Chinese Chess by Tsan-sheng Hsu
XiangQi (Chinese Chess) by Harm Geert Muller
WinBoard and XiangQi by Harm Geert Muller
中国象棋电脑应用规范(五)：中国象棋通用引擎协议 Universal Chinese Chess Protocol (UCCI)
电脑象棋联赛 - 象棋百科全书 - Computer Chess League - Chess Encyclopedia

References

^ Xiang Qi Is Not The Elephant Game by Stephen Leary, rec.games.chinese-chess, November 18, 1994
^ Shi-Jim Yen, Jr-Chang Chen, Tai-Ning Yang, Shun-Chin Hsu (2004). Computer Chinese Chess. ICGA Journal, Vol. 27, No. 1, pdf
^ Xiangqi from Wikipedia
^ How to Play Xiangqi - Chinese Chess
^ WXF Notation
^ Xiangqi - Approximate relative values of the pieces - Wikipedia
^ Computer Olympiad 2003 in Graz, Austria, November 26 by Hiroshi Yamashita
^ Clipped from Image by Joke Hellemons
^ Photos 2013 Events: day 3, ICGA

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
1st Computer Olympiad	Jul 25, 2017
20th Computer Olympiad	Feb 5, 2018
2nd Computer Olympiad	Jul 12, 2017
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
6th Computer Olympiad	Jul 22, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
9th Computer Olympiad	Jul 22, 2017
Abyss	Aug 5, 2017
AI Factory	Dec 26, 2015
Barney Pell	Jul 21, 2017
Bing-Jie Shen	Dec 27, 2016
Bitboards	Nov 14, 2017
Bo-Han Lin	Jul 22, 2017
Bo-Nian Chen	Jul 17, 2017
Book Learning	Jan 1, 2017
Chaturanga	Apr 4, 2013
Chaturanga IT	Jan 7, 2016
Chess	Jan 21, 2018
Chess Wizard (GUI)	Sep 27, 2011
Chia-Hui Chang	Jul 21, 2017
Chimo	Jul 26, 2017
Chinese Chess	Jan 16, 2018
Chinese Chess Board Representation	Jul 25, 2017
Chinese Dark Chess	Sep 19, 2017
Ching-Hua Kuo	Jul 22, 2017
Chun Ye	Jul 25, 2017
Chun-Bin Hsu	Jul 23, 2017
Computer Chess Forums	Nov 26, 2017
Elephant	Sep 19, 2016
Endgame Tablebases	Mar 6, 2018
Engines	Mar 10, 2018
Eugenio Castillo Jiménez	Jul 23, 2017
Evert Glebbeek	Sep 25, 2017
Forsyth-Edwards Expanded Notation	Aug 31, 2015
Games	Feb 20, 2018
Gregory Strong	Apr 24, 2017
Guard Heuristic	Nov 18, 2015
Haiying Wang	Jul 27, 2017
Hao Cui	Jun 29, 2017
HaQiKi D	Jul 26, 2017
Harm Geert Muller	Mar 31, 2018
Huafu Chen	Aug 24, 2014
Huang Chen	Dec 27, 2016
Hung-Hsuan Lin	Jul 22, 2017
Hung-Jui Chang	Jul 16, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
James Parker	Oct 20, 2013
Jiao Wang	Jan 3, 2017
Jr-Chang Chen	Sep 18, 2017
Kindergarten Bitboards	Aug 1, 2017
Knowledge	Jul 22, 2017
Kuang-Che Wu	Dec 26, 2016
Mathematician	Apr 9, 2018
Ming-Cheng Cheng	Jul 22, 2017
Mingyang Zhao	Dec 29, 2016
National Chiao Tung University	Jul 23, 2017
National Taiwan University	Jul 21, 2017
Null Move Pruning	Dec 2, 2017
Opening Book	Feb 26, 2018
Pangfeng Liu	Feb 24, 2016
Parabelle	Jul 28, 2017
Pascal Tang	Jul 23, 2017
Perft	Sep 26, 2017
Persistent Hash Table	Dec 31, 2017
Pham Hong Nguyen	Nov 27, 2014
Ping-hsun Wu	Jun 8, 2015
Point Value	Mar 31, 2018
Protocols	Jan 20, 2018
Qiang Gao	Jun 10, 2017
Qiyong Gong	Aug 24, 2014
Quiescence Search	Aug 19, 2017
Ren Wu	Jul 23, 2017
Robots	Feb 20, 2018
Sam Sloan	May 25, 2016
Shanghai Xianqu Info-Tech Co., Ltd.	Sep 27, 2011
Shi-Jim Yen	Jul 22, 2017
Shiga	Jul 26, 2017
Shih-Chieh Huang	Oct 18, 2017
Shogi	Feb 19, 2018
Shun-Chin Hsu	Jul 22, 2017
Shun-Shii Lin	Jan 21, 2017
Sjaak (Glebbeek)	Oct 4, 2017
TAAI	Dec 8, 2014
Tai-Ming Parng	May 23, 2016
Tai-Ning Yang	Jul 22, 2017
TCGA 2011	Dec 8, 2014
TCGA 2012	Jan 21, 2017
TCGA 2014	Dec 18, 2016
Tony Marsland	Nov 27, 2017
Tsan-sheng Hsu	Jul 17, 2017
UCI	Mar 4, 2018
University of Alberta	Feb 20, 2018
WChess	Jan 7, 2016
Wei Liao	Aug 24, 2014
Wei-Lun Kao	Jul 22, 2017
Wen-Jie Tseng	Sep 18, 2017
Wu-Yao Cheng	Apr 13, 2017
Xian	Jul 26, 2017
XieXie	Jul 26, 2017
Xinhe Xu	Jan 3, 2017
Xujun Duan	Aug 24, 2014
Yi-Fan Ke	Feb 16, 2015
Zillions of Games	May 29, 2017

Up one Level

Chinese Chess Board Representation

GerdIsenberg — Tue, 25 Jul 2017 12:03:16 GMT

Home * Games * Chinese Chess * Board Representation

		The Chinese Chess (Xiangqi) board is a grid of 10 horizontal lines (ranks) and 9 vertical lines (files). The pieces are placed on the intersections. We can represent it with a sequence of 12x10=110 integers a[0], a[1], ... , [119]. The actual board is represented by the entries a[11] - a[19],...., a[101] - a[109]. The entries a[0], a[10], a[20],... and a[110]-a[119] represent the edge of the board and are set the value -1.
Xiangqi board ^[1] ^[2]

See also

References

What links here?

References

^ Xiangqi board in the Chinese Garden Qian Yuan of the Botanical Garden of Ruhr University Bochum, Image by Gerd Isenberg, July 07, 2016
^ Zhang Zhenshan (2015). Qian Yuan - Chinesische Gartenkunst in Bochum. DOI:10.13154/RUB.58.61

What links here?

Page	Date Edited
Abyss	Aug 5, 2017
Board Representation	Dec 11, 2017
Chinese Chess	Jan 16, 2018
Chinese Chess Board Representation	Jul 25, 2017
HaQiKi D	Jul 26, 2017

Up one Level

Clobber

GerdIsenberg — Tue, 16 May 2017 19:09:32 GMT

Home * Games * Clobber

		Clobber, a two-player abstract strategy partisan game invented and introduced in 2001 at a combinatorial game theory workshop in Halifax by Michael H. Albert, J. P. Grossman, and Richard J. Nowakowski. The first competitive Clobber tournament was held in February at the Dagstuhl seminar on algorithmic combinatorial game theory ^[1] , where the games were played on a 5x6 board, later computer tournaments include 8x8 and 10x10 boards, initially, each square occupied by a white or black stone, arranged so that the colors alternate. Both player moves in turn and "clobbering" an opponent's stone on an orthogonally adjacent square. White starts and the player with no more moves available loses. The ICGA organizes Clobber tournaments since 2005 during the Olympiads ^[2]. So far, most successful is Johan de Koning's program Pan (Pan.exe).
5 x 6 Clobber, Initial Position ^[3]

Computer Olympiads

Photos

Tilburg 2011, Jaap van den Herik congrats Johan de Koning, Ingo Althöfer with silver medal for McJena ^[4]

Publications

Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer (2002). Solitaire Clobber. CG 2002
Ingo Althöfer (2002). Clobber – A New Game with Very Simple Rules. ICGA Journal, Vol. 25, No. 2
J. P. Grossman (2004). Appendix A: Report on the First International Clobber Tournament. Theoretical Computer Science, Vol. 313, No. 3
Michael H. Albert, J. P. Grossman, Richard J. Nowakowski, David Wolfe (2005). An Introduction to Clobber. INTEGERS: The Electronic Journal of Combinatorial Number Theory, Vol. 5, No. 2
Jan Willemson (2005). A Computer-Clobber Tournament at the Tartu University. ICGA Journal, Vol. 28, No. 1
Jan Willemson, Mark Winands (2005). MILA wins Clobber Tournament. ICGA Journal, Vol. 28, No. 3, pdf » 10th Computer Olympiad
Mark Winands (2006). Pan wins Clobber Tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Wojciech Wieczorek, Rafał Skinderowicz, Jan Kozak, Przemysław Juszczuk (2011). New Trends in Clobber Programming. ICGA Journal, Vol. 34, No. 3
Ingo Althöfer (2012). PAN wins Clobber Tournament. ICGA Journal, Vol. 35, No. 1 » 16th Computer Olympiad
Ingo Althöfer (2013). PAN Wins Clobber Tournament - King of Clobber - De Koning and his PAN. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad, Johan de Koning

External Links

Clobber from Wikipedia
Clobbering from Wikipedia
Clobber ICGA Tournaments
Computer Olympiad 2011 - Clobber by Ingo Althöfer
Clobber research
CG'02 Special Announcements, Elwyn Berlekamp's Clobber problem composition contest, CG 2002
Programming Problems and Competitions - Clobber
IigGameCenter :: Clobber

References

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
11th Computer Olympiad	Jul 22, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
Andrew Lin	Jul 9, 2016
CG 2002	Jun 9, 2015
Clobber	May 16, 2017
Games	Feb 20, 2018
ICGA Journal	Dec 21, 2017
Ingo Althöfer reports to include	Jan 26, 2017
Jan Kozak	Mar 17, 2015
Jan Willemson	Dec 27, 2016
Johan de Koning	Jul 3, 2017
Johannes Schwagereit	Jan 10, 2018
Jörg Sameith	Mar 16, 2016
Mark Winands	Sep 19, 2017
Przemysław Juszczuk	Apr 26, 2014
Rafał Skinderowicz	Mar 17, 2015
Richard J. Nowakowski	Jun 25, 2015
Wojciech Wieczorek	Mar 17, 2015
Zillions of Games	May 29, 2017

Up one Level

Connect Four

GerdIsenberg — Wed, 31 Jan 2018 18:57:23 GMT

Home * Games * Connect Four

		Connect Four, (Connect-Four, Connect 4, The Captain's Mistress, Four in a Row, Four in a Line) a tic-tac-toe like game in which two players drop discs into a 7x6 board. The first player to get four in a row, either vertically, horizontally, or diagonally, wins. The game was known as The Captain's Mistress, released in its current form by Milton Bradley in 1974 (Milton Bradley was acquired by Hasbro in 1984). Connect Four was first (weakly) solved by James D. Allen as announced in a rec.games.programmer posting on October 01, 1988 ^[1], and only 15 days later, Victor Allis announced his independently discovered solution ^[2], described in his thesis ^[3].
Hasbro's Connect 4 ^[4]

See also

Selected Publications

Selected Publications

1988 ...

Victor Allis (1988). A Knowledge-Based Approach of Connect Four: The Game is Over, White to Move Wins. M.Sc. Thesis, Report No. IR-163, Faculty of Mathematics and Computer Science, Vrije Universteit, Amsterdam
Jos Uiterwijk, Jaap van den Herik, Victor Allis (1989). A Knowledge-Based Approach to Connect Four: The Game is Over, White to Move Wins. Heuristic Programming in AI 1
James D. Allen (1989). A note on the Computer Solution of Connect Four. Heuristic Programming in AI 1

1990 ...

James D. Allen (1990). Expert Play in Connect-Four. hosted by John Tromp
James D. Allen (1990). The Complete Book of CONNECT 4. Sterling Publishing

2000 ...

Hendrik Baier (2006). Der Alpha-Beta-Algorithmus und Erweiterungen bei Vier Gewinnt. Bachelor's thesis (German), TU Darmstadt, advisor Johannes Fürnkranz, pdf

2010 ...

James D. Allen (2010 ). The Complete Book of CONNECT 4: History, Strategy, Puzzles. 2nd edition, Sterling Publishing
Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka, Tomoyuki Kaneko (2011). Infinite Connect-Four Is Solved: Draw. Advances in Computer Games 13
Yoshiaki Yamaguchi, Tetsuro Tanaka, Kazunori Yamaguchi (2013). Cylinder-Infinite-Connect-Four except for Widths 2, 6, and 11 is Solved: Drawn. CG 2013
Yoshiaki Yamaguchi, Todd W. Neller (2015). First Player’s Cannot-Lose Strategy in Cylinder-Infinite-Connect-Four for Widths 2 and 6. Advances in Computer Games 14

Forum Posts

AI program solves Connect Four by Victor Allis, rec.games.programmer, October 16, 1988
Connect-4 by Mark Kern, rec.games.programmer, February 25, 1990
mate detetion issue by Mike Adams, CCC, October 24, 2008 » Checkmate
Connect 4 AlphaZero implemented using Python... by Steve Maughan, CCC, January 29, 2018 » AlphaZero, Python

External Links

Connect Four from Wikipedia
Connect Four - Wikibooks
Connect Four by James D. Allen
John's Connect Four Playground by John Tromp
Solving Connect 4: how to build a perfect AI by Pascal Pons
Connect Four Solver
The Rules of The Captain's Mistress
Connect Four - Slides (pdf) MIT, March 9, 2010
How to build your own AlphaZero AI using Python and Keras by David Foster, January 26, 2018 » AlphaZero, Python ^[5]
Connect 4 Game | Toys for Kids from Hasbro Official Website | Hasbro Toys
Connect Four - Numberphile by Brady Haran, December 01, 2013, YouTube Video

References

^ John's Connect Four Playground by John Tromp
^ AI program solves Connect Four by Victor Allis, rec.games.programmer, October 16, 1988
^ Victor Allis (1988). A Knowledge-Based Approach of Connect Four: The Game is Over, White to Move Wins. M.Sc. Thesis, Report No. IR-163, Faculty of Mathematics and Computer Science, Vrije Universteit, Amsterdam
^ Hasbro's 2015 package and board for the trademarked Connect 4 game, © Hasbro, from Connect Four from Wikipedia, Fair use
^ Connect 4 AlphaZero implemented using Python... by Steve Maughan, CCC, January 29, 2018

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
AlphaZero	Feb 10, 2018
Checkmate	Apr 13, 2018
Connect Four	Jan 31, 2018
Connect6	Jul 22, 2017
Deep Learning	Feb 12, 2018
Fail-Soft	Jun 2, 2017
Games	Feb 20, 2018
Hans van der Zijden	Dec 13, 2016
Hendrik Baier	Jan 22, 2018
Jeroen Donkers	Dec 23, 2016
John Tromp	Jan 6, 2017
Jos Uiterwijk	Aug 11, 2017
Lars Bremer	Aug 1, 2013
Neural Networks	Mar 12, 2018
Proof-number search	Jan 22, 2018
Python	Jan 31, 2018
Rasmus Althoff	Jul 23, 2017
SAL	Dec 7, 2017
Steve Maughan	Jan 31, 2018
Victor Allis	Dec 19, 2016
Yoshiaki Yamaguchi	Dec 18, 2016

Up one Level

Connect6

GerdIsenberg — Sat, 22 Jul 2017 18:08:00 GMT

Home * Games * Connect6

		Connect6, Connect(m,n,6,2,1) a two-player abstract strategy board game of the k-in-a-row family similar to Gomoku, introduced in 2003 by I-Chen Wu and presented at Advances in Computer Games 11 in 2005. Black and White alternately place two stones of their own colour on empty intersections of a Go-like board, except that Black (the first player) places one stone only for the first move ^[1]. The one who gets six or more stones in a row (horizontally, vertically or diagonally) first wins the game. Most often, Connect6 is played on a 19x19 Go board, proposed for professional players is a 59x59 board ^[2]. Since 2006, Connect6 is played regularely by computers at the Computer Olympiad organized by the ICGA ^[3]. Search algorithms used are Alpha-Beta / MTD(f) along with VCF search (Victory by Continuous Four) to find a path to win in the endgame ^[4], and Monte-Carlo Tree Search, UCT, as well as Proof-number search also in conjunction with the novel relevance-zone-oriented proof (RZOP) search used to solve various openings, such as the Mickey Mouse opening ^[5].
Connect6 on a large board ^[6]

Selected Publications

Selected Programs

Bitstronger aka Cloudict by Liang Li, Hao Cui, Ruijian Wang, Siran Lin
MeinStein by Theo van der Storm, Jan Krabbenbos
MoreThenFive by Jiajia Guo, Xiaomeng Yang, Liang Yunzhao, Jianbo Zhao
NCTU6 by I-Chen Wu, Hsiu-Chen Chang
X6 by Sih-Yuan Liou, Shi-Jim Yen

GUI

ConnectMore by Liang Li written in Python 3 - for Cloudict and more ... ^[7]

Computer Olympiads

Selected Publications

2005 ...

I-Chen Wu, Dei-Yen Huang (2005). A New Family of k -in-a-Row Games. Advances in Computer Games 11, pdf
I-Chen Wu, Dei-Yen Huang, Hsiu-Chen Chang (2005). Connect6. ICGA Journal, Vol. 28, No. 4, pdf
I-Chen Wu, Shi-Jim Yen (2006). NCTU6 wins Connect6 tournament. ICGA Journal, Vol. 29, No. 3 » 11th Computer Olympiad
I-Chen Wu, Shi-Jim Yen (2007). X6 wins Connect6 tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
I-Chen Wu, Ping-Hung Lin (2008). NCTU6-Lite wins Connect6 tournament. ICGA Journal, Vol. 31, No. 4 » 13th Computer Olympiad

2009

Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin (2009). On Drawn K-In-A-Row Games. Advances in Computer Games 12
Changming Xu, Zongmin Ma, Junjie Tao, Xinhe Xu (2009). Enhancements of Proof Number Search in Connect6. IEEE Control and Decision Conference
Changming Xu, Zongmin Ma, Xinhe Xu (2009). A method to construct knowledge table-base in k-in-a-row games. SAC 2009
Ping-Hung Lin, I-Chen Wu, Shun-Chin Hsu (2009). Bit wins Connect6 tournament. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
Shi-Jim Yen, Jung-Kuei Yang (2009). The Bitboard Design and Bitwise Computing in Connect Six. 14th Game Programming Workshop

2010 ...

Ping-Hung Lin (2010). Relevance-Zone-Oriented Proof Search for Connect6. Ph.D. thesis
I-Chen Wu, Ping-Hung Lin (2010). Relevance-Zone-Oriented Proof Search for Connect6. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 3
I-Chen Wu, Ping-Hung Lin, Shi-Jim Yen (2010). MoreThenFive wins the Connect-6 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
I-Chen Wu, Hung-Hsuan Lin, Ping-Hung Lin, Der-Johng Sun, Yi-Chih Chan, Bo-Ting Chen (2010). Job-Level Proof-Number Search for Connect6. CG 2010

2011

Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin (2011). Drawn K-In-A-Row Games. Theoretical Computer Science, Volume 412
I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin, Chieh-Min Chang, Ping-Hung Lin (2011). Temporal Difference Learning for Connect6. Advances in Computer Games 13
Shi-Jim Yen, Jung-Kuei Yang (2011). Two-Stage Monte Carlo Tree Search for Connect6. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 3

2012

Liang Li, Hong Liu, Peiyu Liu, Taoying Liu, Wei Li, Hao Wang (2012). A Node-based Parallel Game Tree Algorithm Using GPUs. CLUSTER 2012, pdf
Shi-Jim Yen, Jung-Kuei Yang, Kuo-Yuan Kao, Tai-Ning Yang (2012). Bitboard Knowledge Base System and Elegant Search Architectures for Connect6. Knowledge-Based Systems, Vol. 34

2013

I-Chen Wu, Hao-Hua Kang, Hung-Hsuan Lin, Ping-Hung Lin, Ting-Han Wei, Chieh-Min Chang, Ting-Fu Liao (2013). Dependency-Based Search for Connect6. CG 2013
Ting-Han Wei, Wen-Jie Tseng, I-Chen Wu, Shi-Jim Yen (2013). MOBILE 6 Wins Connect6 Tournament. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad

2014

Ting-Han Wei, I-Chen Wu, Chao-Chin Liang, Bing-Tsung Chiang, Wen-Jie Tseng, Shi-Jim Yen, Chang-Shing Lee (2014). Job-Level Algorithms for Connect6 Opening Position Analysis. ECAI CGW 2014

2015 ...

Ting-Han Wei, I-Chen Wu, Chao-Chin Liang, Bing-Tsung Chiang, Wen-Jie Tseng, Shi-Jim Yen, Chang-Shing Lee (2015). Job-Level Algorithms for Connect6 Opening Book Construction. ICGA Journal, Vol. 38, No. 3
Liang Li, Hong Liu, Hao Wang, Taoying Liu, Wei Li (2015). A Parallel Algorithm for Game Tree Search Using GPGPU. IEEE Transactions on Parallel and Distributed Systems, Vol. 26, No. 8

External Links

References

^ Connect6 from Wikipedia
^ Introduction to Connect6
^ Connect6 (ICGA Tournaments)
^ MoreThenFive (ICGA Tournaments)
^ I-Chen Wu, Ping-Hung Lin (2010). Relevance-Zone-Oriented Proof Search for Connect6. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 3
^ A game of Connect6 played on a large white board, originally posted to Flickr as Closeup of a Connect 6 game by Nelson Pavlosky, January 18, 2007, CC BY-SA 2.0, Wikimedia Commons, Connect6 from Wikipedia
^ GitHub - lang010/ConnectMore: ConnectMore is a UI for Cloudict of the game Connect6, written by Python 3

What links here?

Page	Date Edited
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
Bing-Tsung Chiang	Jul 19, 2017
Bitboards	Nov 14, 2017
Bo Chen	Jun 28, 2017
Changming Xu	Dec 31, 2016
Connect Four	Jan 31, 2018
Connect6	Jul 22, 2017
Dei-Yen Huang	Jul 19, 2017
EinStein würfelt nicht!	Aug 11, 2017
Games	Feb 20, 2018
Hao Cui	Jun 29, 2017
Hao Wang	Jun 27, 2017
Hong Liu	Jun 28, 2017
Hung-Hsuan Lin	Jul 22, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
Jan Krabbenbos	Jan 8, 2018
Jung-Kuei Yang	Jul 22, 2017
Junichi Hashimoto	Jan 4, 2017
Liang Li	Jun 29, 2017
Mathematician	Apr 9, 2018
National Chiao Tung University	Jul 23, 2017
National Taiwan University	Jul 21, 2017
Ping-Hung Lin	Jul 19, 2017
Proof-number search	Jan 22, 2018
Ruijian Wang	Jun 29, 2017
Sheng-Hao Chiang	Apr 19, 2012
Shi-Jim Yen	Jul 22, 2017
Shih-Chieh Huang	Oct 18, 2017
Shun-Chin Hsu	Jul 22, 2017
Shun-Shii Lin	Jan 21, 2017
Siran Lin	Jun 29, 2017
Taoying Liu	Jun 28, 2017
TCGA 2011	Dec 8, 2014
TCGA 2012	Jan 21, 2017
TCGA 2014	Dec 18, 2016
Wei Li	Jun 28, 2017
Wen-Jie Tseng	Sep 18, 2017
Xinhe Xu	Jan 3, 2017
Yi-Chih Chan	Jul 19, 2017
Yunpeng Zhang	Jul 9, 2016
Zongmin Ma	Jun 22, 2015

Up one Level

Draughts

GerdIsenberg — Wed, 12 Jul 2017 21:19:24 GMT

Home * Games * Draughts

		Draughts, a group of two-player zero-sum and perfect information abstract strategy board games which involve diagonal moves of uniform game pieces and mandatory captures by jumping over opponent pieces. The most popular forms are international draughts, also called Polish draughts, played on a 10×10 board and topic of this page, and 8x8 Checkers.
10×10 Draughts starting position ^[1]

International Draughts

International Draughts

The starting position of international draughts has 20 men each placed on its home squares of the 50 relevant dark squares. If a men land on the opponent back rank, it promotes to a king. Men can move diagonally forward, and in international draughts capture forward and backward by moving two consecutive steps in the same line, jumping over the piece on the first step. Multiple opposing pieces may be captured in a single turn provided this is done by successive jumps made by a single piece. The jumps do not need to be in the same line but may "zigzag". In international draughts, kings (sometimes called flying kings) move any distance along unblocked diagonals, and may capture an opposing man any distance away by jumping to any of the unoccupied squares immediately beyond it. Since captured pieces remain on the board until the turn is complete, it is possible to reach a position in a multi-capture move where the flying king is blocked from capturing further by a piece already captured.

Computer Draughts

10x10 Computer Draughts is regular played at the Computer Olympiad. Some (former) chess programmers were or are also active in Computer Draughts, such as Ard van Bergen, Joost Buijs, Eric van Riet Paap, Vincent Diepeveen, Gijsbert Wiesenekker, and Fabien Letouzey ^[2]. The 18th Computer Olympiad, Leiden 2015 had 12 participants, a gained some interests in the computer chess comunity also because Fabien Letouzey participated with his new Draughts program Scan, and even won the tournament. Computer Draughts is a bitboard friendly game, three (all, kings, white) or four bitboards are sufficient to represent the board. In his program Fabien applies his Blockers and Beyond like technique to generate king moves ^[3].

Computer Olympiads

Photos

Yokohama 2013

17th Computer Olympiad, Yokohama 2013, Andrew Lin, Ton Tillemans (Gold) and Tornado operator ^[4] ^[5]

Leiden 2015

18th Computer Olympiad, Leiden 2015, Bert Tuyt, Fabien Letouzey, Ron Van Bemmelen , TD Jaap Bus ^[6]

Publications

1989

Derek Oldbury (1989). AI (Any Interest) for Draughts? Heuristic Programming in AI 1
John Smeets, Gerard Putter (1989). Some Experience with a Self-Learning Computer Program for Playing Draughts. Heuristic Programming in AI 1

2000 ...

Jaap Bus (2002). Dam 2.2 wins Draughts tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Ton Tillemans (2003). Sjende Blyn wins Draughts tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad

2005 ...

Ton Tillemans (2006). TDKing wins the Draughts 10x10 tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Ton Tillemans (2007). Dam 2.2 wins Draughts tournament. ICGA Journal, Vol. 30, No. 3 » 12th Computer Olympiad
Ton Tillemans (2008). TDKing wins Draughts tournament. ICGA Journal, Vol. 31, No. 4 » 13th Computer Olympiad

2010 ...

Ton Tillemans (2010). TDKing wins Draughts Tournament. ICGA Journal, Vol. 33, No. 4 » 15th Computer Olympiad
Jan-Jaap van Horssen (2012). Schwarzman vs. MAXIMUS: A Man-Machine Match in International Draughts. ICGA Journal, Vol. 35, No. 2, pdf
Jan-Jaap van Horssen (2012). Schwarzman vs. MAXIMUS: Games 5 and 6 annotated. ICGA Journal, Vol. 35, No. 3

2015 ...

Jaap Bus (2015). SCAN wins Draughts Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad | Draughts

Forum Posts

(Free) draughts software by A. Presman, World Draughts Forum, April 21, 2012
Draughts at the ICGA Olympiad by Harm Geert Muller, CCC, April 30, 2015
Re: Draughts at the ICGA Olympiad by Fabien Letouzey, CCC, April 30, 2015
Computer Olympiad 2015 Leiden by Bert Tuyt, World Draughts Forum, May 01, 2015
A little more info about Scan by Fabien Letouzey by Jesús Muñoz, CCC, July 06, 2015
Scan by Fabien Letouzey, World Draughts Forum, July 08, 2015
Registration for the 2016 ICGA Computer Olympiad by Jan-Jaap van Horssen, World Draughts Forum, February 29, 2016

External Links

Computer Draughts

Draughts Programs

^[7]

All 10x10 programs in the world
Buggy by Nicolas Guibert
Dam by Harm Jetten
Damage by Bert Tuyt
Dragon draughts by Michel Grimminck
Dynamo Draughts by Adrian Millett
Kingsrow International by Ed Gilbert
Maximus by Jan-Jaap van Horssen
Maximus for Android
Tornado by Frank Mesander

References

^ Starting position on a 10×10 draughts board, Image by Michel32Nl, CC BY-SA 3.0, International draughts from Wikipedia
^ All 10x10 programs in the world
^ personal communication of the editor with Fabien Letouzey at the 18th Computer Olympiad, July 04, 2015
^ Photos 2013 Events: day 4, ICGA
^ Games Tournament 2013 - 10×10 Draughts
^ 18th Computer Olympiad - Day 7 Photos by Jan Krabbenbos
^ (Free) draughts software by A. Presman, World Draughts Forum, April 21, 2012

What links here?

Page	Date Edited
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
1st Computer Olympiad	Jul 25, 2017
20th Computer Olympiad	Feb 5, 2018
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
Adam Oellermann	Feb 15, 2014
Adrian Millett	Jul 12, 2017
Aegon 1993	Mar 26, 2017
Amazons	Aug 12, 2017
Andrew Lin	Jul 9, 2016
Ard van Bergen	Dec 12, 2016
Checkers	Dec 23, 2017
Draughts	Jul 12, 2017
Eric van Riet Paap	Feb 14, 2017
Fabien Letouzey	Feb 5, 2018
Games	Feb 20, 2018
Gijsbert Wiesenekker	Jan 17, 2018
Jan-Jaap van Horssen	Jul 7, 2015
Mark Winands	Sep 19, 2017
Rein Halbersma	Dec 22, 2015
Senpai	Nov 10, 2017
Stef Keetman	Jan 13, 2017
Ton Tillemans	Jan 6, 2017
Yunpeng Zhang	Jul 9, 2016

Up one Level

EinStein würfelt nicht!

GerdIsenberg — Fri, 11 Aug 2017 17:39:05 GMT

Home * Games * EinStein würfelt nicht!

		EinStein würfelt nicht!, (Ewn) a turn-based two-player board game of chance and strategy, designed by Ingo Althöfer in 2004. It was the official game of an exhibition about Albert Einstein in Germany during the World Year of Physics 2005 ^[1]. Ingo introduced his game to computer chess programmers at the IPCCC 2005 in Paderborn, where it was immediately played with enthusiasm between rounds ^[2] ^[3], further spread and played during the ICT 2005 in Leiden the same year.
EinStein würfelt nicht! ^[4]

Rules

Played on a 5x5 board, each player has six cubes or stones numbered one to six, initially placed on the diagonal opposed six corner squares, ordered by their players discretion or randomly ^[5]. The object of the game is to either get an own stone to the opponent's corner, or to remove all of the opponent's stones. A move consists of rolling a six-sided dice to determine a stone to move by its number, and pushing that stone one step forward in one of the three directions closer to opponent's corner. Own and opponent stones on the target square are (self) captured and removed from the board. If the matching stone is no longer on the board, the player choose a remaining one whose number is either next-highest or next-lowest. The fewer stones, the more "mobile" they are. With only one stone (German: "Ein Stein") left, rolling the dice is no longer necessary. This feature along with Albert Einstein's quote "God doesn't play with dice" ^[6] ^[7] ^[8] was eponym of the game ^[9].

Computer Ewn

Ewn Computer bots usually apply some sort of Monte-Carlo tree search. Since 2011, EinStein würfelt nicht! is played at the Computer Olympiad, also with some computer chess programmers competing with their own Ewn bots - Richard Pijl and Johannes Zwanzger ^[10]. In Tilburg 2011, Theo van der Storm's former Connect6 program MeinStein ^[11], written in Java, won the Gold medal, operated by Jan Krabbenbos.

Computer Olympiads

Photos

ICT 2005

Theo van der Storm and Jan Krabbenbos playing EinStein würfelt nicht! during ICT 2005 ^[12].

Tilburg 2011



Ingo Althöfer and Richard J. Lorentz playing Ewn! at the 16th Computer Olympiad, Tilburg 2011 ^[13]

Grace and Jan Krabbenbos with Gold for Theo's MeinStein, Silver for Wesley Turner on the right ^[14]

Publications

2009

Jakob Erdmann (2009). Chanciness: Towards a Characterization of Chance in Games. ICGA Journal, Vol. 32, No. 4, 7.2 EinStein Würfelt Nicht

2010 ...

Jakob Erdmann (2010). The Characterization of Chance and Skill in Games. Dissertation, Friedrich-Schiller-Universität Jena, pdf, 20 "EinStein Würfelt Nicht!" and Variants Thereof, pp. 95-107 ^[15]
Richard J. Lorentz (2011). An MCTS Program to Play EinStein Würfelt Nicht! Advances in Computer Games 13
Wesley Turner (2012). EinStein Würfelt Nicht – An Analysis of Endgame Play. ICGA Journal, Vol. 35, No. 2 » 16th Computer Olympiad

2015 ...

Michael Hartisch (2015). Impact of Rounding during Retrograde Analysis for a Game with Chance Nodes: Karl’s Race as a Test Case. ICGA Journal, Vol. 38, No. 2 » Retrograde Analysis ^[16]
Ingo Althöfer (2015). HANFRIED wins EinStein Würfelt Nicht! Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad | EWN
Édouard Bonnet (2017). Analytical Solution for "EinStein würfelt nicht!" with One Stone. Advances in Computer Games 15
Simon Viennot (2017). Toward Solving "EinStein würfelt nicht!". Advances in Computer Games 15

Forum Posts

Re: Pictures of the IPCCC 2005 by Richard Pijl, CCC, February 27, 2005
Ein Stein Wuerfelt nicht (One stone doesn't throw dice) by Theo van der Storm, CCC, March 03, 2005
A challenge to Theo van der Storm! by Ingo Althöfer, CCC, March 04, 2005 ^[17]
Rules of "EinStein wuerfelt nicht" by Ingo Althöfer, CCC, March 05, 2005
EinStein würfelt nicht by Edmund Moshammer, CCC, January 14, 2009
Einstein wuerfelt nicht by Harm Geert Muller, CCC, July 03, 2016 » WinBoard, XBoard

External Links

EinStein würfelt nicht! - Wikipedia
EinStein würfelt nicht! | Board Game | BoardGameGeek
On the Origins of "EinStein würfelt nicht!" by Ingo Althöfer
Einstein würfelt nicht von Ingo Althöfer, Copyright 2004 (German)
Einstein wuerfelt nicht - Perlhuhn.de
"Gott würfelt nicht" -- "EinStein" auch nicht, Heise online, April 21, 2005 (German)
Stormy's Corner in remembrance on Theo van der Storm, CSVN site, Download of MeinStein

Tournaments

Online Play

References

^ EinStein würfelt nicht! - Wikipedia
^ Re: Pictures of the IPCCC 2005 by Richard Pijl, CCC, February 27, 2005
^ Paderborner Bilderbogen, Computerschach und Spiele Online
^ On the Origins of "EinStein würfelt nicht!" by Ingo Althöfer
^ Rules of "EinStein wuerfelt nicht" by Ingo Althöfer, CCC, March 05, 2005
^ Copenhagen interpretation - Criticism | Wikipedia
^ Albert Einstein - Wikiquote
^ Quantum mechanics is very worthy of regard. But an inner voice.. from iz quotes
^ On the Origins of "EinStein würfelt nicht!" by Ingo Althöfer
^ "EinStein würfelt nicht" in the Computer Olympiad 2011 by Ingo Althöfer
^ Stormy's Corner in remembrance on Theo van der Storm, CSVN site, Download of MeinStein
^ Photo from 5th CSVN-Tournament 2005 Gallery
^ 16th Computer Olympiad, Tilburg 2011], Photo by [[Gerd Isenberg
^ "EinStein würfelt nicht" in the Computer Olympiad 2011 by Ingo Althöfer
^ A central part of the thesis was published in: Jakob Erdmann (2009). Chanciness: Towards a Characterization of Chance in Games. ICGA Journal, Vol. 32, No. 4
^ Karl's Race A Game on Karl Scherer's Alternating Tiling by Ingo Althöfer, 2006
^ See the CCC match between Ingo Althöfer and Theo van der Storm on Ingo Althöfer's "Einstein würfelt nicht" site (German)

What links here?

Page	Date Edited
16th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
20th Computer Olympiad	Feb 5, 2018
Andrew Lin	Jul 9, 2016
Edmund Moshammer	Sep 23, 2017
EinStein würfelt nicht!	Aug 11, 2017
Games	Feb 20, 2018
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Ingo Althöfer reports to include	Jan 26, 2017
Jan Krabbenbos	Jan 8, 2018
Jörg Sameith	Mar 16, 2016
Mathematician	Apr 9, 2018
Michael Hartisch	Aug 11, 2017
Pseudorandom number generator	May 11, 2017
Retrograde Analysis	Mar 21, 2017
Richard J. Lorentz	Aug 11, 2017
Theo van der Storm	Apr 5, 2017
Wesley Turner	Jan 7, 2017
WinBoard	Mar 4, 2018
XBoard	Jan 21, 2018
Yunpeng Zhang	Jul 9, 2016

Up one Level

Game Notation

GerdIsenberg — Thu, 11 Jan 2018 20:41:50 GMT

Home * Chess * Game * Notation

Game Notation refers to the recording of moves of the chess game including players or programs names, date, name of event and site - in human competitive chess each side is required to fill and sign a score sheet. In official computer chess over the board tournaments, it was required for human operators as well, but was practically relaxed since programs keep their internal move list persistent and were able to restart for instance after a power failure ^[1]. In Chess GUIs, the game notation is presented inside a notation window, which may allow certain interactions, like scrolling the list, or replaying the game.

Chess Notation

While the move numeration is quite obvious, starting with move number one, there are various Chess notations with different move syntax defined. Most common in printed and electronic chess media, also in chess programs and databases, is the Algebraic Chess Notation, especially its short form called SAN. Descriptive chess notation was used in English and Spanish-language literature until the late 20th century, but is today somehow obsolete.

Algebraic figurine notation (FAN) uses graphical piece symbols rather than national language dependent letters for pieces, early promoted by Chess Informant. In an attempt of Computer vision, Henry S. Baird and Ken Thompson used optical character recognition along with various heuristics and applying the rules of chess, to "read" the games of Informant's Encyclopaedia of Chess Openings with high accuracy and a success rate of 99.995% on approximately one million characters (2850 games, 945 pages) ^[2]. FAN is supported by various chess GUIs, corresponding chess symbols are available in Unicode ^[3] ^[4].

Sample Score sheet

Image

Game Notation of Bobby Fischer - Miguel Najdorf in Descriptive chess notation:

Bobby Fischer - Miguel Najdorf, 19th Chess Olympiad, 1970, Siegen, West Germany ^[5] ^[6]

PGN

The above Game Notation in SAN as Portable Game Notation:

[Event "19th Chess Olympiad"]
[Site "Siegen, Germany"]
[Date "1970.??.??"]
[Round "3"]
[Result "1-0"]
[White "Robert James Fischer"]
[Black "Miguel Najdorf"]
 
1. e4 c5 2. Nf3 e6 3. d4 cxd4 4. Nxd4 a6 5. Bd3 Nf6 6. O-O d6
7. c4 Bd7 8. Nc3 Nc6 9. Be3 Be7 10. h3 Ne5 11. Be2 Rc8 12. Qb3
Qc7 13. Rac1 O-O 14. f4 Nc6 15. Nf3 Qb8 16. Qd1 Be8 17. Qd2
Na5 18. b3 b6 19. Bd3 Nc6 20. Qf2 b5 21. Rfd1 Nb4 22. Bf1 bxc4
23. bxc4 a5 24. Nd4 Qa8 25. Qf3 Na6 26. Ndb5 Nc5 27. e5 dxe5
28. Qxa8 Rxa8 29. fxe5 Nfe4 30. Nd6 Bc6 31. Ncxe4 Nxe4 32. c5
Ng3 33. Bc4 h5 34. Bf2 h4 35. Bxg3 hxg3 36. Bb5 Bxb5 37. Nxb5
f6 38. Rd7 Bd8 39. Rc3 fxe5 40. Rxg3 Rf7 41. Rxf7 Kxf7 42. c6
Bb6+ 43. Kf1 Kf8 44. c7 Rc8 45. a4 e4 46. Ke2 e5 47. Rg6 Bd4
48. h4 Bb2 1-0

Publications

Henry S. Baird, Ken Thompson (1990). Reading Chess. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 12, No. 6, pdf
Christian Wirth, Johannes Fürnkranz (2015). On Learning From Game Annotations. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 3

Forum Posts

Chess Artist by Ferdinand Mosca, CCC, October 15, 2016 » Chess Artist
PGN score annotation tags wv and bv by Dann Corbit, CCC, January 10, 2018 » Portable Game Notation

External Links

References

^ really?
^ Henry S. Baird, Ken Thompson (1990). Reading Chess. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 12, No. 6, pdf
^ Unicode values for chessmen by Steven Edwards, CCC, March 07, 2011
^ Miscellaneous Symbols – Test for Unicode support in Web browsers
^ JPEG BOBBY
^ Robert James Fischer vs Miguel Najdorf (1970) from chessgames.com
^ Chess Artist by Ferdinand Mosca, CCC, October 15, 2016

What links here?

Page	Date Edited
Acornsoft Chess	Dec 11, 2016
Algebraic Chess Notation	Sep 25, 2017
Aquarium	Dec 4, 2016
Atom Chess	Dec 11, 2016
Chess	Jan 21, 2018
Chess 2013	Nov 6, 2013
Chess Game	Mar 28, 2017
ChessBase (Database)	Feb 26, 2018
ChessPartner	Nov 13, 2017
CLI	Jan 20, 2018
Encoding Moves	Mar 27, 2016
Entering Moves	Sep 7, 2017
Fifty-move Rule	Aug 9, 2017
Game Notation	Jan 11, 2018
GUI	Mar 16, 2018
Logging	Jan 20, 2018
Move List	Jul 19, 2017
Moves	Feb 19, 2018
MVC to include	May 7, 2011
N.N.	Jan 20, 2018
Portable Game Notation	Jan 11, 2018
Repetitions	Jan 16, 2018
Rex	Jan 7, 2016
Steven Edwards	Aug 26, 2017
User Interface	Feb 21, 2018
WCCC 1986	Jul 27, 2017
Stockfish : home	Feb 2, 2014

Up one Level

Games

GerdIsenberg — Tue, 20 Feb 2018 15:32:24 GMT

Home * Games

John von Neumann classified Chess as two-player zero-sum abstract strategy board game with perfect information. This page gives a brief overview on chess variants and other games, which are interesting for chess programmers due to new and innovative approaches and algorithms in search, evaluation and learning.

Board Games

Chess Variants

Abstract Board Games

Mancala Games

Games of Chance

Without perfect information

Card Games

Single-player

Misc

Publications

1913

Ernst Zermelo (1913). Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. Proc. Fifth Congress Mathematicians, (Cambridge 1912), Cambridge Univ. Press 1913, 501–504. Translation: On an Application of Set Theory to the Theory of the Game of Chess. ^[2]

1920 ...

Émile Borel (1921). La théorie du jeu et les équations intégrales à noyau symétrique. Comptes Rendus de Académie des Sciences, Vol. 173, pp. 1304-1308, English translation by Leonard J. Savage (1953). The Theory of Play and Integral Equations with Skew Symmetric Kernels.
Dénes Kőnig (1927). Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta Scientiarum Mathematicarum (University of Szeged)
John von Neumann (1928). Zur Theorie der Gesellschaftsspiele, Berlin ^[3]

1930 ...

Émile Borel, Jean Ville (1939). Applications de la théorie des probabilités aux jeux de hasard. Gauthier-Villars (Applications of probability theory to gambling)

1940 ...

Émile Borel, André Chéron (1940,1954). Théorie mathématique du bridge à la portée de tous. Gauthier-Villars Translated by Alec Traub as The Mathematical Theory of Bridge. amazon
John von Neumann, Oskar Morgenstern (1944). Theory of Games and Economic Behavior. Princeton University Press
Merrill M. Flood, Leonard J. Savage (1948). A Game Theoretic Study of the Tactics of Area Defense. RAND Corporation
Claude Shannon (1949). Programming a Computer for Playing Chess. pdf

1950 ...

Harold W. Kuhn, Albert W. Tucker (eds) (1950). Contributions to the Theory of Games I. Princeton University Press
- Hermann Weyl (1950). Elementary Proof of a Minimax Theorem due to von Neumann.
- David Gale, S. Sherman (1950). Solutions of Finite Two-persons Games.
- George W. Brown, John von Neumann (1950). Solutions of Games by Differential Equations.
- David Gale, Harold W. Kuhn, Albert W. Tucker (1950). On Symmetric Games.
- David Gale, Harold W. Kuhn, Albert W. Tucker (1950). Reduction of Game Matrices.
John Nash (1950). Non-Cooperative Games. dissertation
John Nash (1952). Some Games and Machines for Playing Them. Technical Report D-1164, Rand Corp.
Harold W. Kuhn, Albert W. Tucker (eds) (1953). Contributions to the Theory of Games II. Princeton University Press
- John von Neumann (1953). A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem.
- Donald B. Gillies, John P. Mayberry, John von Neumann (1953). Two Variants of Poker.
- David Gale and Frank Stewart (1953). Infinite Games with Perfect Information.
- Lloyd Shapley (1953). A Value for n-person Games.
Claude E. Shannon (1953). Computers and Automata. Proceedings of the Institute of Radio Engineers Vol. 41, No. 10 ^[4]
Émile Borel, Maurice R. Fréchet, John von Neumann (1953). Discussion of the Early History of the Theory of Games, with Special Reference to the Minimax Theorem. Econometrica, Vol. 21, 97-127
Alan Turing (1953). Digital Computers Applied to Games, in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines, from oldcomputerbooks.com
Richard E. Bellman (1954). On a new Iterative Algorithm for Finding the Solutions of Games and Linear Programming Problems. Technical Report P-473, RAND Corporation, U. S. Air Force Project RAND, Santa Monica, CA
Richard E. Bellman (1957). The Theory of Games. Technical Report P-1062, RAND Corporation, Santa Monica, CA
Harold W. Kuhn, Albert W. Tucker (1958). John von Neumann's work in the theory of games and mathematical economics. Bulletin American Mathematical Sociaty Vol. 64, No. 3, pdf
Allen Newell, Cliff Shaw, Herbert Simon (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing, pp. 256-264

1960 ...

Robert Charles Bell (1960). Board and Table Games from Many Civilisations. Oxford University Press
Melvin Dresher (1961). Games of Strategy: Theory and Applications. Prentice Hall, RAND paper as pdf
John Maynard Smith, Donald Michie (1961). Machines that play games. New Scientist, Vol. 12
Ewald Burger (1963). Introduction to the Theory of Games. Prentice Hall
Richard E. Bellman (1965). On the Application of Dynamic Programming to the Determination of Optimal Play in Chess and Checkers. Proceedings of the National Academy of Sciences of the United States of America
Donald Michie (1966). Game Playing and Game Learning Automata. Advances in Programming and Non-Numerical Computation, Leslie Fox (ed), pp. 183-200. Oxford, Pergamon. » Includes Appendix: Rules of SOMAC by John Maynard Smith, introduces Expectiminimax tree ^[5]
Robert Charles Bell (1969). Board and Table Games 2 from Many Civilisations, Oxford University Press, Oxford.

1970 ...

Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227, index
Marc Eisenstadt, Yaakov Kareev (1973). Toward a Model of Human Game Playing. IJCAI 1973, pdf
John H. Conway (1976). On Numbers and Games. Academic Press ^[6]
Hans Berliner, Richard Greenblatt, Jacques Pitrat, Arthur Samuel, David Slate (1977). Panel on Computer Game Playing. IJCAI 1977, pdf
Aviezri Fraenkel, Michael R. Garey, David S. Johnson, Thomas J. Schaefer, Yaacov Yesha (1978). The Complexity of Checkers on an N * N Board. FOCS 1978 » Checkers
Robert Charles Bell (1979). Board and Table Games from Many Civilisations, Oxford University Press, Oxford, ISBN 0-486-23855-5.

1980 ...

Melvin Dresher (1981). The Mathematics of Games of Strategy: Theory and Applications. Dover Publications, amazon.com
Aviezri Fraenkel, David Lichtenstein (1981). Computing a Perfect Strategy for n x n Chess Requires Time Exponential in N. Journal of Combinatorial Theory, Ser. A, Vol. 31, No. 2
Elwyn Berlekamp, John H. Conway, Richard K. Guy (1982). Winning Ways for your Mathematical Plays. Vol. 1, 1st edition, Academic Press,
Elwyn Berlekamp, John H. Conway, Richard K. Guy (1982). Winning Ways for your Mathematical Plays. Vol. 2, 1st edition, Academic Press
John Maynard Smith (1982). Evolution and the Theory of Games. Cambridge; New York, Cambridge University Press.
Robert Axelrod (1984). The Evolution of Cooperation, pdf
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1988). Algorithms for Games. Springer-Verlag, New York, NY. ISBN 3-540-96629-3.
John Maynard Smith (1988). Games, Sex, and Evolution. New York, Harvester-Wheatsheaf.
Kenneth A. De Jong, Alan C. Schultz (1988). Using Experience-Based Learning in Game Playing. Proceedings of the Fifth International Machine Learning Conference, CiteSeerX » Learning, Othello

1990 ...

Mikhail Donskoy, Jaap van den Herik, Bob Herschberg (1990). Finessing in Games. ICCA Journal, Vol. 13, No. 4
Richard K. Guy, John H. Conway, Elwyn Berlekamp, Vera Pless, Aviezri Fraenkel, Richard J. Nowakowski (1991). Combinatorial Games. Proceedings of Symposia in Applied Mathematics, No. 43
Alan Frank (1991). Brute Force Search in Games of Imperfect Information. Heuristic Programming in AI 2
Frank Thuijsman (1992). An Introduction to the Theory of Games. Heuristic Programming in AI 3
Victor Allis (1994). Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, pdf
Warren D. Smith, Kevin J. Lang (1994). Values of the merging function and algorithm design as a game. NEC Research Institute, ps

1995 ...

Richard J. Nowakowski (ed) (1996). Games of No Chance. MSRI Publications Volume 29
Barney Pell, Susan L. Epstein, Robert Levinson (1996). Introduction to the special issue on games: Structure and Learning. Computational Intelligence, Vol. 12, No. 1, pdf
Yoav Freund, Robert Schapire (1996). Game Theory, On-line Prediction and Boosting. COLT 1996, pdf
Eric B. Baum, Warren D. Smith (1997). A Bayesian Approach to Relevance in Game Playing. Artificial Intelligence, Vol. 97, CiteSeerX
Aviezri Fraenkel, Dmitri Zusman (1998). A New Heap Game. CG 1998
Aviezri Fraenkel, Ofer Rahat (1998). Infinite Cyclic Impartial Games. CG 1998
Uri Blass, Aviezri Fraenkel, Romina Guelman (1998). How Far Can Nim in Disguise be Stretched? pdf
Jacques Pitrat (1998). Games: The Next Challenge. ICCA Journal, Vol. 21, No. 3
Ronald S. Burt (1999). Private Games are too Dangerous. pdf
Susan L. Epstein (1999). Game Playing: The Next Moves. AAAI-99 Proceedings, pdf

2000 ...

Aviezri Fraenkel (2000). Virus Versus Mankind. CG 2000
Alexander Nareyek (2000). Review: Intelligent Agents for Computer Games. CG 2000

2001

Richard K. Guy (2001). Aviezri Fraenkel and Combinatorial Games. Electronic Journal of Combinatorics 8 (2). pdf
John H. Conway (2001). On Numbers and Games. 2nd edition, A K Peters Ltd.
Elwyn Berlekamp, John H. Conway, Richard K. Guy (2001). Winning Ways for your Mathematical Plays. Vol. 1, 2nd edition, A K Peters Ltd.

2002

Richard J. Nowakowski (ed) (2002). More Games of No Chance. Cambridge University Press
Jaap van den Herik, Jos Uiterwijk, Jack van Rijswijck (2002). Games Solved: Now and in the Future. Artificial Intelligence, Vol. 134, Nos.1-2, pp. 277-311. ISSN 0304-3975, zipped ps
Jeroen Donkers, Jos Uiterwijk, Alex de Voogt (2002). Mancala Games - Topics in Artificial Intelligence and Mathematics. In Jean Retschitzki, Rosita Haddad-Zubel (eds.) (2002). Step by step. Proceedings of the 4th colloquium Board games in academia. Edition Universitaires Fribourg Suisse
Jean Retschitzki, Rosita Haddad-Zubel (eds.) (2002). Step by step. Proceedings of the 4th colloquium Board games in academia. Edition Universitaires Fribourg Suisse
Ingo Althöfer (2002). Inventing Game Variants with Computer Help. 7th Computer Olympiad Workshop
Ingo Althöfer, Raymond Georg Snatzke (2002). Playing Games with Multiple Choice Systems. CG 2002
Michael Buro (2002). ORTS: A Hack-Free RTS Game Environment. CG 2002, pdf
Craig A. Lindley, Mirjam Eladhari (2002). Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games. CG 2002

2003

Ingo Althöfer (2003). Computer-Aided Game Inventing. Friedrich Schiller University of Jena, pdf
Pedro Campos, Thibault Langlois (2003). Abalearn: a Program that Learns How to Play Abalone. ICGA Journal, Vol. 26, No. 4
Erik D. Demaine, Susan Hohenberger, David Liben-Nowell (2003). Tetris is Hard, Even to Approximate. COCOON 2003, slides as Tetris is Hard: An Introduction to P vs NP (pdf)
Elwyn Berlekamp, John H. Conway, Richard K. Guy (2003). Winning Ways for your Mathematical Plays. Vol. 2, 2nd edition, A K Peters Ltd.
Elwyn Berlekamp, John H. Conway, Richard K. Guy (2003). Winning Ways for your Mathematical Plays. Vol. 3, A K Peters Ltd.

2004

Elwyn Berlekamp, John H. Conway, Richard K. Guy (2004). Winning Ways for your Mathematical Plays. Vol. 4, A K Peters Ltd.
Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter Kosters, David Liben-Nowell (2004). Tetris is hard, even to approximate. International Journal of Computational Geometry & Applications, Vol. 14
Jörg Bewersdorff (2004). Luck, logic and white lies: The mathematics of games. preface and contents, A K Peters ^[7]
Fernand Gobet, Alex de Voogt, Jean Retschitzki (2004). Moves in Mind: The Psychology of Board Games. ISBN 1-84169-336-7
Julio César Hernández-Castro, Ignacio Blasco-López, L.Javier Garcéa-Villalba (2004). Hiding Data in Games. ICGA Journal, Vol. 27, No. 2
Ingo Althöfer (2004). Improved game play by multiple computer hints. Theoretical Computer Science, Vol. 313, No. 3

2005 ...

Cameron Browne (2005). Connection Games: Variations on a Theme. A K Peters
Paul Schuytema, Mark Manyen (2005). Game Development With LUA. Charles River Media Game Development, Amazon.com ^[8]
I-Chen Wu, Dei-Yen Huang (2005). A New Family of k-in-a-Row Games. Advances in Computer Games 11, pdf

2006

Alessandro Cincotti (2006). Counting the Number of Three-Player Partizan Cold Games. CG 2006
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman (2006). LUMINES Strategies. CG 2006 ^[9]
Peter Bro Miltersen, Troels Bjerre Sørensen (2006). Computing Proper Equilibria of Zero-Sum Games. CG 2006
Cherif R. S. Andraos, Manal M. Zaky, Salma A. Ghoneim (2006). Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types. CG 2006
Aviezri Fraenkel (2006). Nim is Easy, Chess is Hard – But Why?? ICGA Journal, Vol. 29, No. 4, pdf
Robert Aubrey Hearn (2006). Games, Puzzles, and Computation. Ph.D. thesis, Massachusetts Institute of Technology, advisors: Erik D. Demaine, Gerald Jay Sussman, pdf
Jill Cirasella, Danny Kopec (2006). The History of Computer Games. pdf
Nicolò Cesa-Bianchi, Gábor Lugosi (2006). Prediction, Learning, and Games. Cambridge University Press
Michael Bowling, Johannes Fürnkranz, Thore Graepel, Ron Musick (2006). Machine learning and Games. Machine Learning, Vol. 63, No. 3

2007

Michael H. Albert, Richard J. Nowakowski, David Wolfe (2007). Lessons in Play: An Introduction to Combinatorial Game Theory. A K Peters Ltd.
Alvin E. Roth (2007). Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions. International Journal of Game Theory, Special Issue in Honor of David Gale on his 85th birthday, 36, March, 2008, 537-569. pdf

2008

Jeffrey Y. Kim, Jonathan P. Allen, Elan Lee (2008). Alternate reality gaming. Communications of the ACM, Vol. 51, No. 2
Cameron Browne (2008). Automatic Generation and Evaluation of Recombination Games, Doctoral Dissertation, Queensland University of Technology, pdf ^[10]
Brian Schwab (2008). AI Game Engine Programming. Second Edition
Maria Cutumisu, Michael Bowling, Duane Szafron, Richard Sutton (2008). Agent Learning using Action-Dependent Learning Rates in Computer Role-Playing Games. Proceedings of the Fourth Artificial Intelligence and Interactive Digital Entertainment Conference, pdf

2009

Daniel Andersson (2009) Perfect-Information Games with Cycles. Ph.D. thesis, Aarhus University, advisor Peter Bro Miltersen, pdf
Thomas Fischer (2009). Bridg-It – Beating Shannon’s Analog Heuristic. pdf
Jakob Erdmann (2009). Chanciness: Towards a Characterization of Chance in Games. ICGA Journal, Vol. 32, No. 4
Pim Nijssen (2009). Using Intelligent Search Techniques to Play the Game Khet. Master's Thesis, Maastricht University, pdf ^[11]
Richard J. Nowakowski (2009). The History of Combinatorial Game Theory. Dalhousie University, pdf
Michael H. Albert, Richard J. Nowakowski (eds) (2009). Games of No Chance 3. Cambridge University Press
Wojciech Jaśkowski, Krzysztof Krawiec (2009). Formal Analysis and Algorithms for Extracting Coordinate Systems of Games. CIG 2009
Richard Zhao, Duane Szafron (2009). Learning Character Behaviors Using Agent Modeling in Games. AIIDE 2009, CiteSeerX
Maria Cutumisu, Duane Szafron (2009). An Architecture for Game Behavior AI: Behavior Multi-Queues. AIIDE 2009, pdf

2010 ...

Alessandro Cincotti (2010). N-player partizan games. Theoretical Compututer Science, Vol. 411, No. 34-36, doi: 10.1016/j.tcs.2010.05.018
Julien Lemoine, Simon Viennot (2010). Computer analysis of Sprouts with nimbers. To appear in Games of No Chance 4
Jakob Erdmann (2010). The Characterization of Chance and Skill in Games. Dissertation, Friedrich-Schiller-Universität Jena, pdf ^[12]
Robert Leonard (2010). Von Neumann, Morgenstern, and the Creation of Game Theory. From Chess to Social Science, 1900–1960

2011

Donald Knuth (2011). Selected Papers on Fun and Games. CSLI lecture notes series 192, Cambridge University Press, ISBN 978-1-57586-584-3
Ingo Althöfer (2011). On Games with Random-Turn Order and Monte Carlo Perfectness. ICGA Journal, Vol. 34, No. 4
Xiaocong Gan, Yun Bao, Zhangang Han (2011). Real-Time Search Method in Nondeterministic Game - Ms.Pac-Man. ICGA Journal, Vol. 34, No. 4
Thorsten Ederer, Ulf Lorenz, Thomas Opfer, Jan Wolf (2011). Modeling Games with the Help of Quantified Integer Linear Programs. Advances in Computer Games 13

2012

Jan van Rijn (2012). Playing Games: The complexity of Klondike, Mahjong, Nonograms and Animal Chess. Master's thesis, Leiden Institute of Advanced Computer Science, pdf
Abdallah Saffidine, Tristan Cazenave (2012). A General Multi-Agent Modal Logic K Framework for Game Tree Search. ECAI CGW 2012
Yuichiro Sato, Alessandro Cincotti, Hiroyuki Iida (2012). An Analysis of Voting Algorithm in Games. ECAI CGW 2012
Gabriel Synnaeve, Pierre Bessière (2012). A Bayesian Tactician. ECAI CGW 2012

2013

Staffan Björk (2013). On The Foundations of Digital Games. University of Gothenburg, pdf ^[13]
Ulf Lorenz, Thomas Opfer, Jan Wolf (2013). Solution Techniques for Quantified Linear Programs and the links to Gaming. CG 2013
Abdallah Saffidine (2013). Solving Games and All That. Ph.D. thesis, Université Paris-Dauphine, advisor Tristan Cazenave, pdf ^[14]
Katja Grace (2013). Algorithmic Progress in Six Domains. Technical report 2013-3, Machine Intelligence Research Institute, Berkeley, CA, pdf, 5 Game Playing, 5.1 Chess, 5.2 Go, 9 Machine Learning
Yngvi Björnsson, Stephan Schiffel (2013). Comparison of GDL Reasoners. IJCAI 2013 ^[15]
David V. Pynadath, Paul S. Rosenbloom, Stacy C. Marsella, Lingshan Li (2013). Modeling Two-Player Games in the Sigma Graphical Cognitive Architecture. AGI 2013, pdf

2014

Hendrik Jan Hoogeboom, Walter Kosters, Jan van Rijn, Jonathan K. Vis (2014). Acyclic Constraint Logic and Games. ICGA Journal, Vol 37, No. 1
Ingo Althöfer, Roland Voigt (2014). Spiele, Rätsel, Zahlen. Springer Spektrum, ISBN 978-3-642-55301-1, Zusatzmaterial (German)
David W. King (2014). Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas. Masters thesis, Air Force Institute of Technology, pdf ^[16]
David W. King, Gilbert L. Peterson (2014). Epaminondas: Exploring Combat Tactics. ICGA Journal, Vol. 37, No. 3 ^[17]

2015 ...

Cameron Browne (ed.) (2015). Game & Puzzle Design, Vol. 1, No. 1.
Michael Hartisch (2015). Impact of Rounding during Retrograde Analysis for a Game with Chance Nodes: Karl’s Race as a Test Case. ICGA Journal, Vol. 38, No. 2 » EinStein würfelt nicht!, Retrograde Analysis ^[18]
Dap Hartmann (2015). That PEGs the Question: Is it a Game? (Review) ICGA Journal, Vol. 38, No. 2 ^[19]
Ingo Althöfer (2015). Obituary: John Nash, A Beautiful Mind has Gone. ICGA Journal, Vol. 38, No. 2 » John Nash ^[20]
Philippe Uyttendaele, Frank Thuijsman (2015). Evolutionary Games and Local Dynamics. International Game Theory Review, Vol. 17, No. 2
Johannes Heinrich, Marc Lanctot, David Silver (2015). Fictitious Self-Play in Extensive-Form Games. JMLR: W&CP, Vol. 37, pdf
Christian Wirth, Johannes Fürnkranz (2015). On Learning From Game Annotations. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 3

2016

Todd W. Neller et al. (2016). Monte Carlo Approaches to Parameterized Poker Squares. CG 2016 ^[21]
Johannes Heinrich, David Silver (2016). Deep Reinforcement Learning from Self-Play in Imperfect-Information Games. arXiv:1603.01121

2017

Jakub Kowalski, Jakub Sutowicz, Marek Szykuła (2017). Regular Boardgames. arXiv:1706.02462
Noah Weninger, Ryan Hayward (2017). Exploring Positional Linear Go. Advances in Computer Games 15, pdf
Jos Uiterwijk (2017). Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy. Advances in Computer Games 15, arXiv:1703.10678
Jakub Kowalski, Jakub Sutowicz, Marek Szykuła (2017). Evaluating Chess-like Games Using Generated Natural Language Descriptions. Advances in Computer Games 15
Enkhbold Nyamsuren, Wim van der Vegt, Wim Westera (2017). Automated Adaptation and Assessment in Serious Games: a Portable Tool for Supporting Learning. Advances in Computer Games 15
Keigo Kawamura, Naoki Mizukami, Yoshimasa Tsuruoka (2017). Neural Fictitious Self-Play in Imperfect Information Games with Many Players. Computer Games Workshop at IJCAI 2017, pdf
Yasuhiko Takenaga, Yo Shimada (2017). Strategies for Single-Player PuyoPuyo. ICGA Journal, Vol. 39, No. 2 ^[22]
Marc Lanctot, Vinícius Flores Zambaldi, Audrunas Gruslys, Angeliki Lazaridou, Karl Tuyls, Julien Pérolat, David Silver, Thore Graepel (2017). A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning. arXiv:1711.00832
Johannes Fürnkranz (2017). Machine Learning and Game Playing. in Claude Sammut, Geoffrey I. Webb (eds) (2017). Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA

Forum Posts

2005 ...

Variants and Board Size by Harm Geert Muller, CCC, October 25, 2007» Chess Variants

2010 ...

WinBoard, exotic version by Harm Geert Muller, CCC, January 15, 2011 » WinBoard
multi-player games thoughts by Daniel Shawul, CCC, October 05, 2011
New chess variants by Ferdinand Mosca, CCC, March 03, 2012 » Chess Variants
for Chess-variant authors by Harm Geert Muller, CCC, September 17, 2014 » Chess Engine Communication Protocol, WinBoard, XBoard
XBoard and chess variants by Evert Glebbeek, CCC, October 28, 2014
UCCI2WB by Harm Geert Muller, CCC, October 27, 2014 » Chinese Chess (Universal Chinese Chess Interface, UCCI)
UCI protocol for chess variants by Evert Glebbeek, CCC, October 28, 2014 » UCI

2015 ...

Something from the poker domain by Steven Edwards, CCC, January 09, 2015
Most common chess variant? by Stefano Gemma, CCC, April 15, 2015 » Chess Variants
Game of the Generals by Ferdinand Mosca, CCC, April 17, 2015

2016

Grande Acedrex by Harm Geert Muller, CCC, January 04, 2016
New chess variant by Evert Glebbeek, CCC, June 06, 2016
Photographing Chess Clock by Harm Geert Muller, CCC, October 10, 2016

2017

The Peace-Chess Challenge by Harm Geert Muller, CCC, September 24, 2017 » Chess Variants
best board representation for variants (javascript) ? by Mahmoud Uthman, CCC, December 10, 2017 » Board Representation, JavaScript

2018

A Chess variant with low draw rate by Kai Laskos, CCC, January 19, 2018 » Chess Variants

External Links

Games played at the Computer Olympiad
Game from Wikipedia
Association for the Study of Play (TASP)
Cameron's Games Page by Cameron Browne

Type of Games

Sport

Cue sports

Robot sports

Game theory

Complexity

Player

Agents

Games Scholars

Workshops & Events

Ingo Althöfer

Pictorial reports and Games by Ingo Althöfer

25. Spielautorentreffen in Göttingen 2005 by Karsten Höser (German)
"EinStein würfelt nicht" - Das Turnier in Jena (German), EinStein würfelt nicht! with Theo van der Storm
Karl's Race, A Game on Karl Scherer's Alternating Tiling, 2006
CeBIT 2007 Spiele erfinden mit Computer-Hilfe (German)
Lange Nacht der Wissenschaften - Long Night of Sciences Jena - 2007
Workshop Jena 2008: Analysis, Design, and Programming of Games
Chrilly Donninger, Stefan Meyer-Kahlen, Frank Schneider and Eiko Bleicher et al.
Games in Shanghai
Lange Nacht der Wissenschaften - Long Night of Sciences, Jena - 2009
Lange Nacht der Wissenschaften - Long Night of Sciences, Jena - 2011
Games and Aesthetics: Play beyond Zero Sums, September 2011 and February 2013
Computer Olympiad 2011 - Clobber » Clobber
"EinStein würfelt nicht" in the Computer Olympiad 2011
Schneider von Gent:, March 2013
Old Lego Bricks in our Washing Machine, June 18 and 29, and July 05, 2013
Match: Lee Sedol vs AlphaGo , March 09, 2016 » AlphaGo

Game Theory

Organizations

Online

Blogs

Designing The Best Board Game On The Planet | FiveThirtyEight by Oliver Roeder, December 31, 2014
The Worst Board Games Ever Invented | FiveThirtyEight by Oliver Roeder, January 08, 2015
Computers Are Learning How To Treat Cancer And Diabetes By Playing Poker And Atari | FiveThirtyEight by Oliver Roeder, January 20, 2015 ^[23]

Misc

AITopics / More Games
Solved game from Wikipedia
Logic and Games (Stanford Encyclopedia of Philosophy)
Game Theory - The Mathematics of Strategy by Erica Klarreich
The Chess and Games Library by Jean-Louis Cazaux
Cameron's Games Page by Cameron Browne
Digenetics - the Evolution Has Begun
Torus Games - players who master the games on the Torus may move on to try them on the more challenging Klein bottle ^[24]
BoardGameGeek from Wikipedia
The Big Game Hunter | Games old and new — the history, the products, the companies and the people involved with board games, card games, skill & action games and parlor games
Conway's Game of Life
3-Hirn-Verlag by Ingo Althöfer, Games, Books and Software (German)
DAWN 11/15 A game of strategy for two players, on the current asteroid mission of NASA by Ingo Althöfer
Hans Magnus Enzensberger (1997). The Number Devil (German: Der Zahlenteufel)
Chick Corea - What Game Shall We Play Today, Return To Forever debut album of Return to Forever, 1972, YouTube Video
featuring Stanley Clarke, Flora Purim, Airto Moreira, and Joe Farell
Casiopea vs. The Square - Eccentric Games, YouTube Video

References

^ Seirawan chess from Wikipedia
^ see Appendix in Ulrich Schwalbe, Paul Walker (1997). Zermelo and the early history of game theory. pdf
^ Alexander Reinefeld (2005). Die Entwicklung der Spielprogrammierung: Von John von Neumann bis zu den hochparallelen Schachmaschinen. slides as pdf, Themen der Informatik im historischen Kontext Ringvorlesung an der HU Berlin, 02.06.2005 (English paper, German title)
^ Hex is a special case of the Shannon Switching Game, from Jack van Rijswijck (2003). Search and evaluation in Hex. Technical report, University of Alberta, pdf
^ see Swap-off by Helmut Richter
^ Donald Knuth (1974). Surreal Numbers - How two ex-students turned on to pure mathematics and found total happiness. Addison-Wesley
^ Jörg Bewersdorff (2008). Spiele aus mathematischer Sicht. slides as pdf
^ Lua (programming language) from Wikipedia
^ Lumines from Wikipedia
^ Ingo Althöfer (2010). Automatic Generation and Evaluation of Recombination Games. Doctoral Dissertation by Cameron Browne, Review, ICGA Journal, Vol. 33, No. 4
^ Khet (game) from Wikipedia
^ A central part of the thesis was published in: Jakob Erdmann (2009). Chanciness: Towards a Characterization of Chance in Games. ICGA Journal, Vol. 32, No. 4
^ The Foundations of Digital Games covers Blaise Pascal, Gottfried Wilhelm Leibniz, Charles Babbage, Ada Lovelace, Alan Turing, John von Neumann, Edward Condon, Claude Shannon, Donald Michie, and Donald E. Knuth
^ Dap Hartmann (2013). From to αβ to ABCD and SMAB. Review. ICGA Journal, Vol. 36, No. 4
^ Game Description Language from Wikipedia
^ Crossings from Wikipedia
^ Epaminondas from Wikipedia
^ Karl's Race A Game on Karl Scherer's Alternating Tiling by Ingo Althöfer, 2006
^ Marieke Peeters (2014) Personalized Educational Games - Developing agent-supported scenario-based training. Ph.D. thesis, Utrecht University
^ John Forbes Nash, Jr. from Wikipedia
^ Poker Squares (a.k.a. Poker Solitaire, Poker Square, Poker Patience)
^ Puyo Puyo from Wikipedia
^ Re: Something from the poker domain by Adam Hair, CCC, January 20, 2015
^ Klein bottle

Up one Level

General Game Playing

GerdIsenberg — Fri, 22 Dec 2017 19:04:31 GMT

Selected Publications

Home * Games * General Game Playing

General Game Playing,
an approach of Artificial Intelligence programs to be able to play more than one game successfully. For games like chess, computers are programmed to play these games using a specially designed algorithm - a chess playing program cannot play checkers. A General Game Playing system, if well designed, would be able to help in other areas, such as in providing intelligence for search and rescue missions ^[1]. One well know commercial General Game program is Zillions of Games by Jeff Mallett and Mark Lefler ^[2] .

Selected Publications

1968 ...

Jacques Pitrat (1968) Realization of a general game-playing program. IFIP Congress (2) 1570-1574

1970 ...

Jacques Pitrat (1971). A General Game Playing Program. in Artificial Intelligence and Heuristic Programming (eds. Findler and Meltzer), pp. 125-155. Edinburgh University Press, ISBN 0-85224-199-2.
Herbert L. Dershem (1979). A General Game Playing Program. Personal Computing, Vol. 3, No. 6, pp. 70

1990 ...

Barney Pell (1992). Metagame: A New Challenge for Games and Learning. Heuristic Programming in Artificial Intelligence 3
Barney Pell (1992). Metagame in Symmetric, Chess-Like Games. Heuristic Programming in Artificial Intelligence 3
Barney Pell (1993). Strategy Generation and Evaluation for Meta-Game Playing. Ph.D: thesis, Trinity College, Cambridge, pdf
Barney Pell (1993). A Strategic Metagame Player for General Chess-Like Games. AAAI Technical Report FS-93-02, pdf
Michael Gherrity (1993). A Game Learning Machine. Ph.D. thesis, University of California, San Diego, advisor Paul Kube, pdf, pdf
Barney Pell, Susan L. Epstein, Robert Levinson (1996). Introduction to the special issue on games: Structure and Learning. Computational Intelligence, Vol. 12, No. 1
Robert Levinson (1996). General Game-Playing and Reinforcement Learning. Computational Intelligence, Vol. 12, No. 1
Barney Pell (1996). A Strategic Metagame Player for General Chess-Like Games. Computational Intelligence, Vol. 12, No. 1

2000 ...

John Romein, Henri Bal, Dick Grune (2000). The Multigame Reference Manual. Vrije Universiteit, pdf
John Romein (2001). Multigame - An Environment for Distributed Game-Tree Search. Ph.D. thesis, Vrije Universiteit, supervisor Henri Bal, pdf
Tomoyuki Kaneko, Kazunori Yamaguchi, Satoru Kawai (2001). Automatic Feature Construction and Optimization for General Game Player. 6th Game Programming Workshop, Hakone
Tomoyuki Kaneko, Kazunori Yamaguchi, Satoru Kawai (2002). Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player. 7th Game Programming Workshop, Hakone
Tomoyuki Kaneko, Kazunori Yamaguchi, Satoru Kawai (2003). Automated Identification of Patterns in Evaluation Functions for General Game Players. Advances in Computer Games 10

2005 ...

Michael Genesereth, Nathaniel Love, Barney Pell (2005). General Game Playing: Overview of the AAAI Competition. AI Magazine, Vol. 26, No. 2, pdf
Michael Thielscher (2005)- Flux: A logic programming method for reasoning agents. Theory Pract.Log. Program, 5(4-5)
Stephan Schiffel, Michael Thielscher (2007). Fluxplayer: A successful general game player. Proceedings of the AAAI National Conference on Artificial Intelligence, pdf
Michel Quenault, Tristan Cazenave (2007). Extended General Gaming Model. CGW 2007
Hilmar Finnsson and Yngvi Björnsson. (2008). Simulation-Based Approach to General Game Playing. In The Twenty-Third AAAI Conference on Artificial Intelligence, AAAI Press, 2008. Accepted. pdf, pdf
Jean Méhat, Tristan Cazenave (2008). Ary: A Program for General Game Playing. pdf
Jean Méhat, Tristan Cazenave (2008). Monte-Carlo Tree Search for General Game Playing. pdf
Michael Thielscher (2008). Artificial Intelligence and General Game Playing. Workshop Chess and Mathematics » General Game Playing
Mesut Kirci, Jonathan Schaeffer, Nathan Sturtevant (2009). Feature Learning Using State Differences. pdf
Stephan Schiffel, Michael Thielscher (2009). Automated Theorem Proving for General Game Playing. IJCAI 2009

2010 ...

Jean Méhat, Tristan Cazenave (2010). Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4, pdf 2009
Mesut Kirci (2010). Feature Learning using State Differences. Master's thesis, Department of Computing Science, University of Alberta, pdf
Stephan Schiffel (2010). Symmetry Detection in General Game Playing. AAAI 2010
Karol Walędzik, Jacek Mańdziuk (2010). CI in General Game Playing - to date Achievements and Perspectives. 10. ICAISC, pdf

2011

Jean Méhat, Tristan Cazenave (2011). A Parallel General Game Player. KI Journal, Vol. 25, No. 1, pdf
Mesut Kirci, Nathan Sturtevant, Jonathan Schaeffer (2011). A GGP Feature Learning Algorithm. KI 25(1): 35-42, pdf
Michael Thielscher (2011). Special Issue on General Game Playing. KI 25(1)
Abdallah Saffidine, Tristan Cazenave (2011). A forward chaining based game description language compiler. GIGA 2011
Stephan Schiffel (2011). Knowledge-Based General Game Playing. Ph.D. thesis, Dresden University of Technology, advisor Michael Thielscher and Yngvi Björnsson, pdf

2012

Ji Ruan, Michael Thielscher (2012). Model Checking Games in GDL-II. ECAI CGW 2012
Daniel Michulke, Stephan Schiffel (2012). Distance Features for General Game Playing Agents. 4. ICAART 2012, pdf
Jacek Mańdziuk, Maciej Świechowski (2012). Generic Heuristic Approach to General Game Playing. 38. SOFSEM, pdf

2013

Yngvi Björnsson, Stephan Schiffel (2013). Comparison of GDL Reasoners. IJCAI 2013 ^[3]
Maciej Świechowski, Jacek Mańdziuk (2013). Self-Adaptation of Playing Strategies in General Game Playing. IEEE Transactions on Computational Intelligence and AI in Games, pdf, IEEE Xplore
Abdallah Saffidine (2013). The Game Description Language is Turingcomplete. IEEE Transactions on Computational Intelligence and AI in Games
Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, Martin Riedmiller (2013). Playing Atari with Deep Reinforcement Learning. arXiv:1312.5602 ^[4]

2014

Michael Genesereth, Michael Thielscher (2014). General Game Playing. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers
Stephan Schiffel, Michael Thielscher (2014). Representing and Reasoning About the Rules of General Games With Imperfect Information. JAIR Vol. 49
Édouard Bonnet, Abdallah Saffidine (2014). On the Complexity of General Game Playing. ECAI CGW 2014
Jean-Noël Vittaut, Jean Méhat (2014). Fast Instantiation of GGP Game Descriptions Using Prolog with Tabling. ECAI CGW 2014

2015 ...

Cameron Browne (2016). A Class Grammar for General Games. CG 2016
Nera Nesic, Stephan Schiffel (2016). Heuristic Function Evaluation Framework. CG 2016

External Links

General Game Playing

GDL

Game Description Language from Wikipedia
Game Description Language (GDL) from Stanford
Palamedes IDE Eclipse plugin for GDL

Player

References

^ General Game Playing - Home
^ Zillions of Games from Wikipedia
^ Game Description Language from Wikipedia
^ Demystifying Deep Reinforcement Learning by Tambet Matiisen, Nervana, December 21, 2015

What links here?

Page	Date Edited
Abdallah Saffidine	Aug 11, 2017
Artificial Intelligence	Apr 9, 2018
Barney Pell	Jul 21, 2017
Breakthrough (Game)	Aug 11, 2017
Csaba Jergler	Dec 18, 2016
Daniel Shawul	Jan 28, 2018
Distance	Sep 25, 2015
Flux	Jan 12, 2016
Games	Feb 20, 2018
General Game Playing	Dec 22, 2017
Hector for Chess	Jan 7, 2016
Jacques Pitrat	Aug 7, 2015
Jean Méhat	Jan 19, 2016
Jeff Mallett	Jan 8, 2016
John Romein	Aug 5, 2016
Jonathan Schaeffer	Jan 29, 2018
Jörg Sameith	Mar 16, 2016
Kazunori Yamaguchi	Jun 20, 2016
Languages	Nov 26, 2017
Learning	Feb 20, 2018
Mark Lefler	Nov 23, 2017
Mathematician	Apr 9, 2018
Mesut Kirci	Apr 17, 2011
Michael Gherrity	May 8, 2015
Michael Thielscher	May 21, 2015
Monte-Carlo Tree Search	Apr 26, 2018
Nathan Sturtevant	Oct 23, 2015
Nebiyu	Dec 10, 2017
Neil Burch	Jan 10, 2018
Nikolaos Papahristou	Jan 7, 2017
Occam	Jan 21, 2016
Othello	Jan 4, 2018
Personal Computing	Dec 27, 2017
SAL	Dec 7, 2017
Satoru Kawai	Jun 20, 2016
Scorpio	Mar 28, 2018
Search with Random Leaf Values	Apr 23, 2018
Stephan Schiffel	Jul 8, 2016
Tomoyuki Kaneko	Oct 25, 2017
Tristan Cazenave	Jan 22, 2018
UCT	Jan 22, 2018
Yngvi Björnsson	Jun 26, 2017
Zillions of Games	May 29, 2017

Up one Level

Go

GerdIsenberg — Wed, 24 Jan 2018 15:08:02 GMT

Home * Games * Go

		The game of Go has attracted game researchers and programmers as an ambitious AI-challenge. Albert Zobrist was a pioneer, who wrote the first Go program in 1968 as part of his Ph.D. Thesis on pattern recognition ^[1]. Chess programmers, beside others, Rémi Coulom and Gian-Carlo Pascutto became successful Go programmers with their programs CrazyStone and Leela respectively. Competitive computer Go, as organized by the ICGA ^[2], is played on boards with 9x9 as well with default 19x19 grids. Since Go lacks a simple evaluation function mainly based on counting material, attempts to apply similar techniques and algorithms as in chess were less successful. The breakthrough in computer Go was accomplished by Monte-Carlo tree search and deep learning.
19*19 Go board ^[3]

Progress

Monte-Carlo Go

After early trials to apply Monte Carlo methods to a Go playing program by Bernd Brügmann in 1993 ^[4], recent developments since the mid 2000s by Bruno Bouzy ^[5], and by Rémi Coulom, who coined the term Monte-Carlo Tree Search ^[6], in conjunction with UCT (Upper Confidence bounds applied to Trees) introduced by Levente Kocsis and Csaba Szepesvári ^[7], led to a breakthrough in computer Go ^[8].

CNNs

As mentioned by Ilya Sutskever and Vinod Nair in 2008 ^[9], convolutional neural networks are well suited for problems with a natural translation invariance, such as object recognition. Go has some translation invariance, because if all the pieces on a hypothetical Go board are shifted to the left, then the best move will also shift (with the exception of pieces that are on the boundary of the board). Many applications of neural networks to Go have already used convolutional neural networks, such as Nicol N. Schraudolph et al. ^[10], Erik van der Werf et al. ^[11], and Markus Enzenberger ^[12], among others.

In 2014, two teams independently investigated whether deep convolutional neural networks ^[13] could be used to directly represent and learn a move evaluation function for the game of Go. Christopher Clark and Amos Storkey trained an 8-layer convolutional neural network by supervised learning from a database of human professional games, which without any search, defeated the traditional search program Gnu Go in 86% of the games ^[14] ^[15] ^[16] ^[17] ^[18]. In their paper Move Evaluation in Go Using Deep Convolutional Neural Networks ^[19], Chris J. Maddison, Aja Huang, Ilya Sutskever, and David Silver report they trained a large 12-layer convolutional neural network in a similar way, to beat Gnu Go in 97% of the games, and matched the performance of a state-of-the-art Monte-Carlo Tree Search that simulates a million positions per move ^[20].

AlphaGo

In 2015, a team affiliated with Google DeepMind around David Silver, Aja Huang, Chris J. Maddison, and Demis Hassabis, supported by Google researchers John Nham and Ilya Sutskever, build a Go playing program dubbed AlphaGo, combining Monte-Carlo tree search with their 12-layer networks ^[21], the “policy network,” to select the next move, the “value network,” to predict the winner of the game. The neural networks were trained on 30 million moves from games played by human experts, until it could predict the human move 57 percent of the time. AlphaGo achieved a huge winning rate against other Go programs, and defeated European Go champion Fan Hui ^[22] in October 2015 with a 5 - 0 score ^[23] ^[24]. On March 9 to 15, 2016, AlphaGo won a $1M 5-game challenge match in Seoul versus Lee Sedol with 4 - 1 ^[25] ^[26] ^[27].

During The Future of Go Summit from May 23 to 27, 2017 in Wuzhen, China, AlphaGo won a three-game match versus current world No. 1 ranking player Ke Ji. After the Summit, AlphaGo is now retired from competitive play while DeepMind continues AI research in other areas ^[28].

AlphaGo Zero & AlphaZero

However, in October 2017, AlphaGo Zero, an evolution of AlphaGo was introduced. While previous versions were initially trained on thousands of human amateur and professional games to learn how to play Go, AlphaGo Zero learns exclusively by playing games against itself, starting from completely random play, to quickly surpass human level of play and defeated the previously published champion-defeating version of AlphaGo by 100 games to 0 ^[29] ^[30]. AlphaGo Zero was further improved and even generalized for other games now dubbed AlphaZero, as published in December 2017 ^[31].

Fine Art

Fine Art is a Go playing entity developed since 2016 under the patronage of the Chinese media company Tencent by a team around Liu Yongsheng, along with Ma Bo, Tang Shanmin, Wu Guangyu, and Zhang Kaixu. It won the Computer Go UEC Cup at the University of Electro-Communications, Chōfu, Tokyo, Japan, in March 2017 against a field of 27 other programs including DeepZenGo and Crazy Stone ^[32]. In January 2018, it defeated Ke Jie 9P in 77 moves after giving two stones handicap ^[33] on Fox Weiqi ^[34] server ^[35] ^[36].

Quotes

Quote by Gian-Carlo Pascutto in 2010 ^[37]:

There is no significant difference between an alpha-beta search with heavy LMR and a static evaluator (current state of the art in chess) and an UCT searcher with a small exploration constant that does playouts (state of the art in go).

The shape of the tree they search is very similar. The main breakthrough in Go the last few years was how to backup an uncertain Monte Carlo score. This was solved. For chess this same problem was solved around the time quiescent search was developed.

Both are producing strong programs and we've proven for both the methods that they scale in strength as hardware speed goes up.

So I would say that we've successfully adopted the simple, brute force methods for chess to Go and they already work without increases in computer speed. The increases will make them progressively stronger though, and with further software tweaks they will eventually surpass humans.

Computer Olympiads

Selected Publications

^[38]

1960 ...

Jack Good (1965). The Mystery of Go. Literature: Reports hosted by Atlas Computer Laboratory

1970 ...

Albert Zobrist (1970). Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. Thesis (152 pp.), University of Wisconsin, also published as technical report, pdf
Walter R. Reitman, James Kerwin, Robert Nado, Judith S. Reitman, Bruce Wilcox (1974). Goals and Plans in a Program for Playing Go. Proceedings of the 29th ACM Conference, reprinted in David Levy (ed.) (1988). Computer Games II. google books
Walter R. Reitman, Bruce Wilcox (1975). Perception and representation of spatial relations in a program for playing Go. Proceedings of the 30th ACM Conference, reprinted in David Levy (ed.) (1988). Computer Games II.
Judith S. Reitman (1976). Skilled Perception in Go: Deducing Memory Structures from Inter-Response Times. Cognitive Psychology, Vol. 8, No, 3
Walter R. Reitman, Bruce Wilcox (1977). Pattern Recognition and Pattern-Directed Inference in a Program for Playing Go. ACM SIGART Bulletin, No. 63, reprinted in David Levy (ed.) (1988). Computer Games II.
Editor (1979). Computer GO Has Come. Personal Computing, Vol. 3, No. 5, pp. 55
Walter R. Reitman, Bruce Wilcox (1979). Modelling Tactical Analysis and Problem Solving in Go. Proceedings of the Tenth Annual Pittsburgh Conference on Modelling and Simulation
Walter R. Reitman, Bruce Wilcox (1979). The Structure and Performance of the INTERIM.2 Go Program. IJCAI 1979, reprinted in David Levy (ed.) (1988). Computer Games II.

1980 ...

Editor (1980). The Challenge of Computer Go. Personal Computing, Vol. 4, No. 8, pp. 79
Editor (1980). Zobrist Program in Action. Personal Computing, Vol. 4, No. 8, pp. 81 » Albert Zobrist
Bruce Wilcox (1985). Reflections on building two Go programs. ACM SIGART Bulletin, No. 94
Anders Kierulf (1985). Smart Go Board: Algorithms for the Tactical Calculator. Diploma thesis (unpublished), ETH Zurich.
David Levy (ed.) (1988). Computer Games II. Springer, ISBN: 978-1-4613-8756-5, Chapter 5 - Go
Janusz Kraszek (1988). Heuristics in the life and death algorithm of a Go playing program. Computer Go 9 (Winter 1988-89)
Anders Kierulf, Jürg Nievergelt (1989). Swiss Explorer blunders its way into winning the first computer Go Olympiad. Heuristic Programming in AI 1
Ken Chen (1989). Group Identification in Computer Go. Heuristic Programming in AI 1

1990

Ken Chen (1990). The Move Decision Process of Go Intellect, Computer Go, No.14, pp. 9-17.
Ken Chen, Anders Kierulf, Martin Müller, Jürg Nievergelt (1990). The Design and Evolution of Go Explorer. Computers, Chess, and Cognition
Kiyoshi Shirayanagi (1990). Knowledge Representation and its Refinement in Go Programs. Computers, Chess, and Cognition

1991

David Wolfe (1991). Mathematics of Go: Chilling Corridors. Ph.D. thesis, University of California, Berkeley, advisor Elwyn Berlekamp
Herbert D. Enderton (1991). The Golem Go Program. Technical Report CMU-CS-92-101, Carnegie Mellon University
Ken Chen (1991). Go Intellect wins two Gold Medals. Heuristic Programming in AI 2
Barney Pell (1991). Exploratory Learning in the Game of GO. Heuristic Programming in AI 2
Thomas Wolf (1991). Investigating Tsumego Problems with "RisiKo". Heuristic Programming in AI 2

1992

Warren D. Smith (1992). Hash functions for Binary and Ternary Words. NEC Research Institute, ps
Thomas Wolf (1992). Generating tsume go problems with GoTools. Heuristic Programming in AI 4 ^[39]

1993

David Fotland (1993). Knowledge representation in the Many Faces of Go.
Bernd Brügmann (1993). Monte Carlo Go. pdf ^[40]

1994

Elwyn Berlekamp, David Wolfe (1994). Mathematical Go - Chilling Gets the Last Point. A K Peters Ltd., also in paperback as Mathematical Go Endgames: Nightmares For the Professional Go Player. Ishi Press ^[41]
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sejnowski (1994). Temporal Difference Learning of Position Evaluation in the Game of Go. Advances in Neural Information Processing Systems 6 ^[42]

1995 ...

Jay Burmeister, Janet Wiles (1995). CS-TR-339 Computer Go Tech Report. Departments of Computer Science and Psychology, The University of Queensland, QLD 4072, Australia (permanently - under construction)
Jay Burmeister, Janet Wiles (1995). The Challenge of Go as a Domain for AI Research: A Comparison Between Go and Chess. In Proceedings of the Third Australian and New Zealand Conference on Intelligent Information Systems, IEEE Western Australia Section, pdf
Tristan Cazenave (1995). Learning and Problem Solving in Gogol, a Go playing program. pdf

1996

Bruce Wilcox, Sue Wilcox (1996). EZ-GO-Oriental Strategy in a Nutshell. KI Press, ISBN13 978-0965223546 ^[43]
Markus Enzenberger (1996). The Integration of A Priori Knowledge into a Go Playing Neural Network.
Martin Müller, Ralph Gasser (1996). Experiments in Computer Go Endgames. Games of No Chance edited by Richard J. Nowakowski
Martin Müller, Elwyn Berlekamp, Bill Spight (1996). Generalized thermography: Algorithms, implementation, and application to Go endgames. Technical Report 96-030, ICSI Berkeley, 1996. postscript
Bruno Bouzy, Tristan Cazenave (1996). Shared concepts between complex systems and the game of Go. pdf

1997

Tristan Cazenave (1997). Gogol (an Analytical Learning Program). IJCAI'97, pdf
Bruno Bouzy, Tristan Cazenave (1997). Using the Object Oriented Paradigm to Model Context in Computer Go. Context'97, pdf

1998

Ken Chen (1998). Heuristic Search in Go Game Tree, Proceedings of Joint Conference on Information Sciences ’98, Vol. II, pp. 274-278. The Association for Intelligent Machinery, Inc. ISBN 0-9643456-7-6.
Tristan Cazenave (1998). Integration of Different Reasoning Modes in a Go Playing and Learning System. pdf
Bill Spight (1998). Extended Thermography for Multiple Kos in Go. CG 1998
Martin Müller (1998). Computer Go: A Research Agenda. CG 1998
Shinichi Sei, Toshiaki Kawashima (1998). Memory-Based Approach in Go-program KATSUNARI. Fujitsu Social Science Laboratory, pdf
Morihiko Tajima, Noriaki Sanechika (1998). Estimating the Possible Omission Number for Groups in Go by the Number of n -th Dame. CG 1998

1999

Ken Chen, Zhixing Chen (1999). Static Analysis of Life and Death in the Game of Go. Information Sciences, Vol. 121, Nos. 1-2, pdf

2000 ...

Thomas Thomsen (2000). Lambda-Search in Game Trees - with Application to Go. CG 2000 also published in ICGA Journal, Vol. 23, No. 4, winning the 2001 ICGA Journal Award, preprint as pdf » Lambda-Search
Jan Ramon, Tom Francis, Hendrik Blockeel (2000). Learning a Go Heuristic with Tilde. CG 2000
Martin Müller (2000). Review: Computer Go 1984–2000. CG 2000
Jay Burmeister (2000). Studies in Human and Computer Go: Assessing the Game of Go as a Research Domain for Cognitive Science. Ph.D. thesis, School of Computer Science and Electrical Engineering and School of Psychology, The University of Queensland, Australia, pdf
Jay Burmeister, Yasuki Saito, Atsushi Yoshikawa, Janet Wiles (2000) Memory Performance of Master Go Players. in Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research. pp. 271-286
Ken Chen (2000). Some Practical Techniques for Global Search in Go. ICGA Journal, Vol. 23, No. 2
Kuo-Yuan Kao (2000). Mean and Temperature Search for Go Endgames. Information Sciences, Vol. 122, No. 1
Marcel Crâsmaru, John Tromp (2000). Ladders Are PSPACE-Complete. CG 2000
Shinichi Sei, Toshiaki Kawashima (2000). A Solution of Go on 4x4 Board by Game Tree Search Program. Fujitsu Social Science Laboratory, Japanese pdf
Thomas Wolf (2000). Forward Pruning and Other Heuristic Search Techniques in Tsume Go. Special Issue of Information Sciences, Vol. 122, No. 1, CiteSeerX

2001

Bruno Bouzy (2001). Go Patterns Generated by Retrograde Analysis. 6th Computer Olympiad Workshop, pdf
Erik van der Werf, Jaap van den Herik (2001). Visual Learning in Go. 6th Computer Olympiad Workshop, pdf
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sejnowski (2001). Learning to Evaluate Go Positions via Temporal Difference Methods. in Norio Baba, Lakhmi C. Jain (eds.) (2001). Computational Intelligence in Games, Studies in Fuzziness and Soft Computing. Physica-Verlag, revised version of 1994 paper
Tristan Cazenave (2001). Generating Patterns with External Conditions for the Game of Go. Advances in Computer Games 9, pdf
Jeng-Chi Yan, Shun-Chin Hsu (2001). A Positional Judgment System for computer Go. Advances in Computer Games 9
Bruno Bouzy, Tristan Cazenave (2001). Computer Go: an AI-oriented Survey. Artificial Intelligence Journal, Vol. 132, pdf
Alex B. Meijer, Henk Koppelaar (2001). A learning architecture for the game of Go. Game-On 2001
Alex B. Meijer, Henk Koppelaar (2001). Pursuing abstract goals in the game of Go. BNAIC 2001
Ken Chen (2001). Computer Go: Knowledge, Search, and Move Decision. ICGA Journal, Vol. 24, No. 4, pdf

2002

Tristan Cazenave (2002). Admissible Moves in Two-Player Games. SARA 2002, pdf
Ken Chen (2002). GO4++ wins 19x19 Go tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Erik van der Werf (2002). GO4++ wins 9x9 Go tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Erik van der Werf (2002). Solving Ponnuki-Go on Small Boards. 7th Computer Olympiad Workshop
Erik van der Werf, Jos Uiterwijk, Jaap van den Herik (2002). Solving Ponnuki-Go on Small Boards. BNAIC’02, pdf
Bruno Bouzy (2002). A Small Go Board Study of Metric and Dimensional Evaluation Functions. CG 2002
Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
Bill Spight (2002). Evaluating Kos in a Neutral Threat Environment: Preliminary Results. CG 2002
Teigo Nakamura, Elwyn Berlekamp (2002). Analysis of Composite Corridors. CG 2002
David Fotland (2002). Static Eye in "The Many Faces of Go". ICGA Journal, Vol. 25, No. 4
Zhixing Chen (2002). Semi-Empirical Quantitative Theory of Go Part I: Estimation of the Influence of a Wall. ICGA Journal, Vol. 25, No. 4
Martin Müller (2002). Position Evaluation in Computer Go. ICGA Journal, Vol. 25, No. 4
David Wolfe (2002). Go endgames are PSPACE-hard. in Richard J. Nowakowski (ed) (2002). More Games of No Chance. Cambridge University Press

2003

Matthew Pratola, Thomas Wolf (2003). Optimizing GOTOOLS' Search Heuristics using Genetic Algorithms. ICGA Journal, Vol. 26, No. 1, also arXiv:cs/0302002 » Genetic Programming
Ken Chen (2003). Soft decomposition search and binary game forest model for move decision in Go, Information Sciences, Vol. 154, Issues 3-4, 157-172, pdf
Markus Enzenberger (2003). Evaluation in Go by a Neural Network using Soft Segmentation. Advances in Computer Games 10, pdf
Akihiro Kishimoto, Martin Müller. (2003). Df-pn in Go: An Application to the One-Eye Problem. Advances in Computer Games 10, pdf » Proof-Number Search ^[44]
Bruno Bouzy, Bernard Helmstetter (2003). Monte Carlo Go Developments. Advances in Computer Games 10, pdf
Bruno Bouzy (2003). Mathematical morphology applied to computer go. IJPRAI Vol. 17, No. 2
Bruno Bouzy (2003). The move decision strategy of Indigo. ICGA Journal, Vol. 26, No. 1
Ken Chen (2003). The Way to Go is Bottom Up. ICGA Journal, Vol. 26, No. 2
Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2003). Solving Go on Small Boards. ICGA Journal, Vol. 26, No. 2, pdf
Ken Chen (2003). GNUGo wins 19x19 Go tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad
Erik van der Werf (2003). Aya wins 9x9 Go tournament. ICGA Journal, Vol. 26, No. 4 » 8th Computer Olympiad
Alex B. Meijer, Henk Koppelaar (2003). Towards Multi-Objective Game Theory - with Application to Go. Game-On 2003, pdf

2004

Bruno Bouzy (2004). Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go. CG 2004
Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). Learning to Estimate Potential Territory in the Game of Go. CG 2004, pdf
Xiaozhen Niu, Martin Müller (2004). An Improved Safety Solver for Computer Go. CG 2004
Jan Ramon, Tom Croonenborghs (2004). Searching for Compound Goals Using Relevancy Zones in the Game of Go. CG 2004
David Fotland (2004). Go Intellect wins 19x19 Go tournament. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad
Bruno Bouzy (2004). Go Intellect wins 9x9 Go tournament. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad
Erik van der Werf (2004). AI techniques for the game of Go. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands. ISBN 90 5278 445 0, pdf
Bruno Bouzy (2004). Toward a go player computational model. Habilitation to Supervise Research document, Paris 6 University

2005 ...

Tristan Cazenave, Bernard Helmstetter (2005). Combining tactical search and Monte-Carlo in the game of Go. IEEE CIG 2005, pdf, pdf
Tristan Cazenave (2005). The separation game. JCIS 2005, pdf
Shi-Jim Yen, Jr-Chang Chen (2005). Handtalk III wins 19x19 Go tournament. ICGA Journal, Vol. 28, No. 3 » 10th Computer Olympiad
Shi-Jim Yen, Jeng-Chi Yan (2005). Go Intellect wins 9x9 Go tournament. ICGA Journal, Vol. 28, No. 3 » 10th Computer Olympiad
Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
Bruno Bouzy (2005). Move-Pruning Techniques for Monte-Carlo Go. Advances in Computer Games 11
Bruno Bouzy (2005). Associating domain-dependent knowledge and Monte Carlo approaches within a go program. Information Sciences, Heuristic Search and Computer Game Playing IV

2006

Ken Chen, Peigang Zhang (2006). A New Heuristic Search Algorithm for Capturing Problems in Go. CG 2006
Xiaozhen Niu, Martin Müller (2006). An Open Boundary Safety-of-Territory Solver for the Game of Go. CG 2006
Jahn-Takeshi Saito, Guillaume Chaslot, Jos Uiterwijk, Jaap van den Herik (2006). Monte-Carlo Proof-Number Search for Computer Go. CG 2006
Tristan Cazenave (2006). Virtual Global Search: Application to 9×9 Go. CG 2006
Rémi Coulom (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. CG 2006, pdf
John Tromp, Gunnar Farnebäck (2006). Combinatorics of Go. CG 2006
Rémi Coulom, Ken Chen (2006). Crazy Stone wins 9x9 Go tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Rémi Coulom, Ken Chen (2006). Gnu Go wins 19x19 Go tournament. ICGA Journal, Vol. 29, No. 2 » 11th Computer Olympiad
Bruno Bouzy (2006). History and Territory Heuristics for Monte-Carlo Go. New Mathematics and Natural Computation
Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura (2006). Monte Carlo Go Has a Way to Go. AAAI 2006, pdf
Julio César Hernández-Castro, Ignacio Blasco-López, Juan M. Estevez-Tapiador, Arturo Ribagorda-Garnacho (2006). Steganography in games: A general methodology and its application to the game of Go. Computers & Security, Vol. 25, pdf ^[45]

2007

Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller (2007). Lambda Depth-First Proof-Number Search and Its Application to Go. 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pdf » Proof-Number Search
Tristan Cazenave (2007). Playing the Right Atari. ICGA Journal, Vol. 30, No. 1, pdf
Erik van der Werf (2007). Steenvreter wins 9x9 Go tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
Sylvain Gelly, Yizao Wang (2007). MoGo wins 19x19 Go tournament. ICGA Journal, Vol. 30, No. 2 » 12th Computer Olympiad
Ken Chen, Peigang Zhang (2007). Monte-Carlo Go with Knowledge-Guided Simulations. CGW 2007
Esa A. Seuranen (2007). Introducing Playing Style to Computer Go. CGW 2007, pdf
Thomas Wolf, Lei Shen (2007). Checking Life & Death Problems in Go. I: The Program SCANLD. CGW 2007, pdf
Rémi Coulom (2007). Computing Elo Ratings of Move Patterns in the Game of Go. CGW 2007
Rémi Coulom (2007). Computing Elo Ratings of Move Patterns in the Game of Go. ICGA Journal, Vol. 30, No. 4, pdf
Nobuo Araki, Kazuhiro Yoshida, Yoshimasa Tsuruoka, Jun'ichi Tsujii (2007). Move Prediction in Go with the Maximum Entropy Method. CIG 2007, pdf

2008

Ken Chen, Peigang Zhang (2008). Monte-Carlo Go with Knowledge-Guided Simulations. ICGA Journal, Vol. 31, No. 2
Tristan Cazenave (2008). Multi-player Go. CG 2008
Ling Zhao, Martin Müller (2008). Using Artificial Boundaries in the Game of Go. CG 2008
Ken Chen, Dawei Du, Peigang Zhang (2008). A Fast Indexing Method for Monte-Carlo Go. CG 2008
Xiaozhen Niu, Martin Müller (2008). An Improved Safety Solver in Go Using Partial Regions. CG 2008
Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Mei-Hui Wang, Shang-Rong Tsai, Shun-Chin Hsu (2008). Human-Computer Go Revolution 2008. ICGA Journal, Vol. 31, No. 3
Shogo Takeuchi, Tomoyuki Kaneko, Kazunori Yamaguchi (2008). Evaluation of Monte Carlo tree search and the application to Go. CIG 2008
Peigang Zhang, Ken Chen (2008). Monte-Carlo Go Capturing Tactic Search. New Mathematics and Natural Computation, Vol. 4, No. 3
Ilya Sutskever, Vinod Nair (2008). Mimicking Go Experts with Convolutional Neural Networks. ICANN 2008, pdf
Thomas Wolf (2008). Mastering Ladders. Slate & Shell

2009

Esa A. Seuranen (2009). Entropy in Go. ICGA Journal, Vol. 32, No. 1
Mark Winands (2009). Many Faces of Go wins 9x9 and 19x19 Go tournaments. ICGA Journal, Vol. 32, No. 1 » 13th Computer Olympiad
Markus Enzenberger, Martin Müller (2009). Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search. pdf
Martin Müller (2009). Fuego at the Computer Olympiad in Pamplona 2009: A Tournament Report. TR09-09, pdf
Rémi Coulom (2009). The Monte-Carlo Revolution in Go. JFFoS'2008: Japanese-French Frontiers of Science Symposium, slides as pdf
Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong (2009). The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. pdf
Chang-Shing Lee, Mei-Hui Wang, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo (2009). A Novel Ontology for Computer Go Knowledge Management. IEEE FUZZ (2009), pdf
Vincent Berthier, Amine Bourki, Matthieu Coulm, Guillaume Chaslot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Rémi Munos, Julien Pérez, Arpad Rimmel, Philippe Rolet, Olivier Teytaud, Paul Vayssière, Yizao Wang, Ziqin Yu (et al.) (2009). Computer-Go is not only for Go. Korea, August 2009 slides as pdf
Ken Chen (2009). Fuego wins 9x9 Go tournaments. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
Ken Chen (2009). Zen wins 19x19 Go tournaments. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
John Tromp, Gunnar Farnebäck (2009). Combinatorics of Go. (revisited version of the CG 2006 paper)
Ken Chen, Dawei Du, Peigang Zhang (2009). Monte-Carlo Tree Search and Computer Go. Advances in Information and Intelligent Systems 2009
Seth Pellegrino, Andrew Hubbard, Jason Galbraith, Peter D. Drake, Yung-Pin Chen (2009). Localizing Search in Monte-Carlo Go using Statistical Covariance. ICGA Journal, Vol. 32, No. 3
Thomas Wolf (2009). A library of eyes in Go, I: A life & death definition consistent with `bent-4'. in Michael H. Albert, Richard J. Nowakowski (eds) (2009). Games of No Chance 3. Cambridge University Press, pdf
Thomas Wolf, Matthew Pratola (2009). A library of eyes in Go, II: Monolithic eyes. in Michael H. Albert, Richard J. Nowakowski (eds) (2009). Games of No Chance 3. Cambridge University Press, pdf

2010 ...

Frank Karger, Michael Babar (2010). MyGoFriend wins Go 9x9 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
Shih-Chieh Huang, Shi-Jim Yen (2010). Many Faces of Go wins Go 13x13 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
David Fotland (2010). Erica wins Go 19x19 Tournament. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2010). Monte-Carlo Simulation Balancing applied to 9x9 Go. ICGA Journal, Vol. 33, No. 4
Krzysztof Krawiec, Marcin Szubert (2010). Coevolutionary Temporal Difference Learning for small-board Go. IEEE Congress on Evolutionary Computation
Hendrik Baier (2010). Adaptive Playout Policies for Monte-Carlo Go. Master's thesis, University of Osnabrück, pdf
Hendrik Baier, Peter D. Drake (2010). The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4
Chang-Shing Lee, Mei-Hui Wang, Shi-Jim Yen, Yu-Jen Chen, Cheng-Wei Chou, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Hassen Doghmen (2010). An ontology-based fuzzy inference system for computer Go applications. International Journal of Fuzzy Systems, Vol. 12, No. 2, pdf

2011

Abdallah Saffidine (2011). Moccos wins the Panthom-Go Tournament. ICGA Journal, Vol. 34, No. 1 » 15th Computer Olympiad
Ingo Althöfer (2011). John Tromp in the Style of David Levy: 4-0 win in the Go bet. ICGA Journal, Vol. 34, No. 2 » John Tromp ^[46]
Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2011). Time Management for Monte-Carlo Tree Search Applied to the Game of Go. TAAI 2010, pdf
Shih-Chieh Huang (2011). New Heuristics for Monte Carlo Tree Search Applied to the Game of Go. Ph.D. thesis, pdf
Hendrik Baier, Mark Winands (2011). Active Opening Book Application for Monte-Carlo Tree Search in 19x19 Go. BNAIC 2011, pdf
Petr Baudiš, Jean-Loup Gailly (2011). Pachi: State of the Art Open Source Go Program. Advances in Computer Games 13
Hendrik Baier, Mark Winands (2011). Time Management for Monte-Carlo Tree Search in Go. Advances in Computer Games 13
Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Ming Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen (2011). Towards a Solution of 7x7 Go with Meta-MCTS. Advances in Computer Games 13
Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies (2011). Blunder Cost in Go and Hex. Advances in Computer Games 13
Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu (2011). 4*4-Pattern and Bayesian Learning in Monte-Carlo Go. Advances in Computer Games 13
Sylvain Gelly, David Silver (2011). Monte-Carlo tree search and rapid action value estimation in computer Go. Artificial Intelligence, Vol. 175, No. 11
Łukasz Lew (2011). Modeling Go Game as a Large Decomposable Decision Process. Ph.D. thesis, University of Warsaw
Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011). Evolving small-board Go players using Coevolutionary Temporal Difference Learning with Archives. Applied Mathematics and Computer Science, Vol. 21, No. 4
Thomas Wolf (2011). A Dynamical Systems Approach for Static Evaluation in Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 3, No 2, also arXiv:1108.4220 ^[47]

2012

Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, David Silver, Csaba Szepesvári (2012). The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Vol. 55, No. 3, pdf preprint
Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Shi-Jim Yen (2012). Human vs. Machine Go Competitions in IEEE WCCI 2012. ICGA Journal, Vol. 35, No. 4
Ching-Nung Lin, Shi-Jim Yen (2012). The Computer Go Tournaments in TCGA 2012. ICGA Journal, Vol. 35, No. 4
Ping-Chiang Chou, Shi-Jim Yen, Cheng-Wei Chou, Ching-Nung Lin, Chang-Shing Lee, Olivier Teytaud, Hassen Doghmen (2012). A simple Tsumego Generator. GPW 2012

2013

Cheng-Wei Chou, Ching-Nung Lin, Shi-Jim Yen, Hideki Kato, Jr-Chang Chen (2013). The 6th GPW Cup 9x9 and 13x13 Computer Go Tournaments. ICGA Journal, Vol. 36, No. 1
Ching-Nung Lin, Shi-Jim Yen (2013). The TAAI 2012 Computer Go Tournaments and Human vs. Computer Go Competition. ICGA Journal, Vol. 36, No. 1
Mark Boon (2013). The Beginning of Computer-Go Programs. ICGA Journal, Vol. 36, No. 2
Kokolo Ikeda, Simon Viennot (2013). Production of various strategies and position control for Monte-Carlo Go - Entertaining human players. CIG 2013
Shih-Chieh Huang, Martin Müller (2013). Investigating the Limits of Monte Carlo Tree Search Methods in Computer Go. CG 2013
Tobias Graf, Lars Schaefers, Marco Platzner (2013). On Semeai Detection in Monte-Carlo Go. CG 2013, pdf ^[48]
Sumudo Fernando, Martin Müller (2013). Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. CG 2013
David Silver, Richard Sutton, Martin Mueller (2013). Temporal-Difference Search in Computer Go. Proceedings of the ICAPS-13 Workshop on Planning and Learning, pdf
Katja Grace (2013). Algorithmic Progress in Six Domains. Technical report 2013-3, Machine Intelligence Research Institute, Berkeley, CA, pdf, 5 Game Playing, 5.1 Chess, 5.2 Go, 9 Machine Learning
Chun-Hsiang Hsieh, Jeng-Chi Yan (2013). The Design and Development of a 9 by 9 GO Opening Game Knowledge Base System. International Journal of Information and Education Technology, Vol. 3, No. 4

2014

Lars Schaefers (2014). Parallel Monte-Carlo Tree Search for HPC Systems and its Application to Computer Go. Ph.D. thesis, University of Paderborn, advisors Marco Platzner, Ulf Lorenz, pdf, pdf
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren (2014). Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi. CoRR abs/1409.4297 » MCTS, Parallel Search, x86-64
Christopher Clark, Amos Storkey (2014). Teaching Deep Convolutional Neural Networks to Play Go. arXiv:1412.3409 » DCNN in Go
Chris J. Maddison, Aja Huang, Ilya Sutskever, David Silver (2014). Move Evaluation in Go Using Deep Convolutional Neural Networks. arXiv:1412.6564v1 » DCNN in Go
Ingo Althöfer, Raymond Georg Snatzke (2014). The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE. ICGA Journal, Vol. 37, No. 4 ^[49] ^[50] ^[51]

2015 ...

Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen (2015). The complexities of Go. Advances in Computer Games 14
Kokolo Ikeda, Takanari Shishido, Simon Viennot (2015). Machine-Learning of Shape Names for the Game of Go. Advances in Computer Games 14
Yuandong Tian, Yan Zhu (2015). Better Computer Go Player with Neural Network and Long-term Prediction. arXiv:1511.06410 ^[52] ^[53] » Neural Networks
Thomas Wolf (2015). A Classification of Semeai with Approach Moves. ICGA Journal, Vol. 38, No. 4, arXiv:1608.02890
Peter H. Jin, Kurt Keutzer (2015). Convolutional Monte Carlo Rollouts in Go. arXiv:1512.03375
Lars Schaefers, Marco Platzner (2015). Distributed Monte Carlo Tree Search: A Novel Technique and its Application to Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 4 ^[54]

2016

David Silver, Aja Huang, Chris J. Maddison, Arthur Guez, Laurent Sifre, George van den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, Sander Dieleman, Dominik Grewe, John Nham, Nal Kalchbrenner, Ilya Sutskever, Timothy Lillicrap, Madeleine Leach, Koray Kavukcuoglu, Thore Graepel, Demis Hassabis (2016). Mastering the game of Go with deep neural networks and tree search. Nature, Vol. 529 » AlphaGo
Tobias Graf, Marco Platzner (2016). Using Deep Convolutional Neural Networks in Monte Carlo Tree Search. CG 2016
John Tromp (2016). The number of legal Go positions. CG 2016
John Tromp, Matthieu Walraet (2016). A googolplex of Go games. CG 2016
Aja Huang (2016). AlphaGo: Combining Deep Neural Networks with Tree Search. CG 2016, Keynote Lecture
Ingo Althöfer (2016). Computer-Aided Go: Chess as a Role Model. CG 2016
Peter H. Jin , Kurt Keutzer (2016). Convolutional Monte Carlo Rollouts for Computer Go. CG 2016
Chang-Shing Lee, Mei-Hui Wang, Shi-Jim Yen, Ting-Han Wei, I-Chen Wu, Ping-Chiang Chou, Chun-Hsun Chou, Ming-Wan Wang, Tai-Hsiung Yang (2016). Human vs. Computer Go: Review and Prospect. arXiv:1606.02032
Jonathan Rosenthal (2016). Deep Learning for Go. B.Sc. thesis, ETH Zurich

2017

Tristan Cazenave (2017). Residual Networks for Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. PP, No. 99, pdf
Ti-Rong Wu, I-Chen Wu, Guan-Wun Chen, Ting-Han Wei, Tung-Yi Lai, Hung-Chun Wu, Li-Cheng Lan (2017). Multi-Labelled Value Networks for Computer Go. arXiv:1705.10701
Tristan Cazenave (2017). Improved Policy Networks for Computer Go. Advances in Computer Games 15, pdf
Thomas Wolf (2017). Seki with 2 Liberties per Chain in the Game of Go. ICGA Journal, Vol. 39, No. 2
Jon Diamond (2017). A History of Go-playing Programs. ICGA Journal, Vol. 39, No. 2
David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, Yutian Chen, Timothy Lillicrap, Fan Hui, Laurent Sifre, George van den Driessche, Thore Graepel, Demis Hassabis (2017). Mastering the game of Go without human knowledge. Nature, Vol. 550, pdf
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis (2017). Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. arXiv:1712.01815 » AlphaZero

Forum Posts

2005 ...

Ongoing GO programming? by Shivkumar Shivaji, CCC, October 25, 2007
A thought about ratings by Dave Dyer, Computer Go Archive, December 10, 2007 » Playing Strength
Re: A thought about ratings by Don Dailey, Computer Go Archive, December 10, 2007
Re: A thought about ratings by Edward de Grijs, Computer Go Archive, December 10, 2007
Re: A thought about ratings by Don Dailey, Computer Go Archive, December 10, 2007

2010 ...

[Computer-go] learning patterns for mc go by Hendrik Baier, Computer Go Archive, April 26, 2010
WinBoard, exotic version by Harm Geert Muller, CCC, January 15, 2011 » WinBoard
Go questions by Kai Laskos, CCC, February 13, 2012
Wired Article on Computer GO by Edmund Moshammer, CCC, May 13, 2014 ^[55]
How many chess programmers are turning to Go? by Eelco de Groot, CCC, August 12, 2014
Teaching Deep Convolutional Neural Networks to Play Go by Hiroshi Yamashita, The Computer-go Archives, December 14, 2014 » DCNN in Go
Teaching Deep Convolutional Neural Networks to Play Go by Michel Van den Bergh, CCC, December 16, 2014
Move Evaluation in Go Using Deep Convolutional Neural Networks by Aja Huang, The Computer-go Archives, December 19, 2014 » DCNN in Go

2015 ...

Number of Go positions computed at last by John Tromp, The Computer-go Archives, January 22, 2016
Go has fallen to computer domination? by Isaac Haïk Dunn, CCC, January 27, 2016 » AlphaGo
Computer Go at master level? by Nicu Ionita, CCC, January 27, 2016
Game Over by Rémi Coulom, The Computer-go Archives, January 27, 2016 » AlphaGo
Mastering the Game of Go with Deep Neural Networks and Tree Search by Aja Huang, The Computer-go Archives, January 27, 2016
AlphaGo by Alvaro, Game-AI Forum, January 29, 2016 » AlphaGo
longest 3x3 game by John Tromp, Computer Go Archive, February 18, 2016
Deep Zen Go - A new Zen to counter AlphaGo by pookpooi, Computer Go, February 29, 2016
Lee Sedol vs. AlphaGo [link to live feed] by Jesse Gersenson, CCC, March 07, 2016
AlphaGo won first game! by Hiroshi Yamashita, The Computer-go Archives, March 09, 2016
Congratulations to AlphaGo by Lukas van de Wiel, The Computer-go Archives, March 12, 2016
UEC cup 1st day result by Hiroshi Yamashita, Computer Go Archive, March 19, 2016
Animation : Ratings of go players since 1974 ! by Vincent Lejeune, CCC, March 20, 2016
World #1 Go Player Ke Jie accepts Google Alpha Go Match.. by AA Ross, CCC, June 07, 2016 » ... Re: World #1 ...
The scaling of Deep Learning MCTS Go engines by Kai Laskos, CCC, October 23, 2016 » Deep Learning, Go, MCTS

2017

mini-max with Policy and Value network by Hiroshi Yamashita, Computer Go Archive, May 20, 2017
Re: World #1 Go Player Ke Jie accepts Google Alpha Go Match. by Kai Laskos, CCC, May 22, 2017 » The Future of Go Summit
Neural nets for Go - chain pooling? by David Wu, Computer Go Archive, August 18, 2017
We are doomed - AlphaGo Zero, learning only from basic rules by Vincent Lejeune, CCC, October 18, 2017
AlphaGo Zero by Alberto Sanjuan, CCC, October 19, 2017
Zero performance by Gian-Carlo Pascutto, Computer Go Archive, October 20, 2017
Re: AlphaGo Zero by Hendrik Baier, Computer Go Archive, October 20, 2017
AlphaGo's evaluation function by Jens Kipper, CCC, November 26, 2017

2018

Breakthrough: FineArt beating Ke Jie with 2 Handicap Stones by Ingo Althöfer, Computer Go Archive, January 20, 2018 » Fine Art

External Links

Tournaments

Computer Go Archives

Computer Go Pages

Sensei's Library: Starting Points
Go Servers at Sensei's Library
John's Go Page by John Tromp
Counting Legal Positions in Go by John Tromp, January 20, 2016
Computer Go Research by Martin Müller
SmartGo Blog by Anders Kierulf

Open Source

GitHub - gcp/leela-zero: Go engine with no human-provided knowledge, modeled after the AlphaGo Zero paper by Gian-Carlo Pascutto et al.
skybrian/Gongo - GitHub, a Go program, written in Go by Brian Slesinsky

Misc

Go Variants
GTP - Go Text Protocol
Cracking GO by Feng-Hsiung Hsu, IEEE Spectrum, October 01, 2007
The Mystery of Go, the Ancient Game That Computers Still Can’t Win by Alan Levinovitz, Wired, May 12, 2014 » Rémi Coulom ^[56]
AIs Have Mastered Chess. Will Go Be Next? by Jonathan Schaeffer, Martin Müller & Akihiro Kishimoto, IEEE Spectrum, June 25, 2014
Facebook trains AI to beat humans at Go board game by Leo Kelion, BBC News, January 27, 2016

Go Challenge

codecentric go challenge

AlphaGo

AlphaGo from Wikipedia
DeepMind - YouTube Channel
Game Over? AlphaGo Beats Pro 5-0 in Major AI Advance « American Go E-Journal, January 27, 2016 » AlphaGo
Google’s AlphaGo Beats Professional Go Player by Anders Kierulf, SmartGo Blog, January 27, 2016
Computer Beats Go Champion for the First Time by Annie Sneed, Scientific American, January 27, 2016
Artificial Intelligence Just Mastered Go, But One Game Still Gives AI Trouble by Carl Engelking, The Crux, January 27, 2016 » Poker, Jonathan Schaeffer, Bart Selman
Official Google Blog: AlphaGo: using machine learning to master the ancient game of Go by Demis Hassabis, January 27, 2016
AlphaGo | Google DeepMind » AlphaGo
The computer that mastered Go, with Demis Hassabis and David Silver, YouTube Video
Match: Lee Sedol vs AlphaGo, Photo Report by Ingo Althöfer, March 09, 2016
Google’s AI beats world Go champion in first of five matches, BBC News, March 09, 2016
Google AI wins second Go game against world champion, BBC News, March 10, 2016
Computer beating top human Go professional by Frederic Friedel, ChessBase News, March 10, 2016
Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol, BBC News, March 12, 2016
AlphaGo vs Lee Sedol: history in the making by Albert Silver, ChessBase News, March 13, 2016
Artificial intelligence: Go master Lee Se-dol wins against AlphaGo program, BBC News, March 13, 2016
Google's AI wins final Go challenge, BBC News, March 15, 2016
What Google’s winning Go algorithm will do next by Elizabeth Gibney, Nature | News, March 15, 2016
Exploring the mysteries of Go with AlphaGo and China's top players by Demis Hassabis, DeepMind, April 10, 2017
The Future of Go Summit, May 23 - 27, Wuzhen, China ^[57] ^[58]
Google's Go-playing AI still undefeated with victory over world number one by Alex Hern, The Guardian, May 25, 2017
Google’s AlphaGo Continues Dominance With Second Win in China by Cade Metz, Wired, May 25, 2017
Google’s AlphaGo Trounces Humans—But It Also Gives Them a Boost by Cade Metz, Wired, May 26, 2017
AlphaGo’s Designers Explore New AI After Winning Big in China by Cade Metz, Wired, May 27, 2017
AlphaGo's next move by Demis Hassabis and David Silver, DeepMind, May 27, 2017
AlphaGo Zero: Learning from scratch by Demis Hassabis and David Silver, DeepMind, October 18, 2017

Fine Art

References

^ Albert Zobrist (1970). Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. thesis , University of Wisconsin, also published as technical report, pdf
^ Go at the Computer Olympiad
^ Go (Spiel) from Wikipedia.de
^ Bernd Brügmann (1993). Monte Carlo Go. pdf
^ Bruno Bouzy (2005). Associating domain-dependent knowledge and Monte Carlo approaches within a go program. Information Sciences, Heuristic Search and Computer Game Playing IV
^ Rémi Coulom (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. CG 2006, pdf
^ Levente Kocsis, Csaba Szepesvári (2006). Bandit based Monte-Carlo Planning. ECML-06, LNCS/LNAI 4212, pdf
^ Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, David Silver, Csaba Szepesvári (2012). The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Vol. 55, No. 3, pdf preprint
^ Ilya Sutskever, Vinod Nair (2008). Mimicking Go Experts with Convolutional Neural Networks. ICANN 2008, pdf
^ Nicol N. Schraudolph, Peter Dayan, Terrence J. Sejnowski (1994). Temporal Difference Learning of Position Evaluation in the Game of Go. Advances in Neural Information Processing Systems 6
^ Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
^ Markus Enzenberger (2003). Evaluation in Go by a Neural Network using Soft Segmentation. Advances in Computer Games 10, pdf
^ Convolutional neural network from Wikipedia
^ Christopher Clark, Amos Storkey (2014). Teaching Deep Convolutional Neural Networks to Play Go. arXiv:1412.3409
^ Deep learning for… Go by Erik Bernhardsson, December 11, 2014
^ Teaching Deep Convolutional Neural Networks to Play Go by Hiroshi Yamashita, The Computer-go Archives, December 14, 2014
^ Why Neural Networks Look Set to Thrash the Best Human Go Players for the First Time | MIT Technology Review, December 15, 2014
^ Teaching Deep Convolutional Neural Networks to Play Go by Michel Van den Bergh, CCC, December 16, 2014
^ Chris J. Maddison, Aja Huang, Ilya Sutskever, David Silver (2014). Move Evaluation in Go Using Deep Convolutional Neural Networks. arXiv:1412.6564v1
^ Move Evaluation in Go Using Deep Convolutional Neural Networks by Aja Huang, The Computer-go Archives, December 19, 2014
^ David Silver, Aja Huang, Chris J. Maddison, Arthur Guez, Laurent Sifre, George van den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, Sander Dieleman, Dominik Grewe, John Nham, Nal Kalchbrenner, Ilya Sutskever, Timothy Lillicrap, Madeleine Leach, Koray Kavukcuoglu, Thore Graepel, Demis Hassabis (2016). Mastering the game of Go with deep neural networks and tree search. Nature, Vol. 529
^ Fan Hui at Sensei's Library
^ Game Over? AlphaGo Beats Pro 5-0 in Major AI Advance « American Go E-Journal, January 27, 2016
^ Official Google Blog: AlphaGo: using machine learning to master the ancient game of Go by Demis Hassabis, January 27, 2016
Google DeepMind: Ground-breaking AlphaGo masters the game of Go, YouTube Video
^ DeepMind - YouTube Channel
^ Video Interview with Rémi Coulom on AlphaGo, February 2016
^ Artificial intelligence: Google's AlphaGo beats Go master Lee Se-dol, BBC News, March 12, 2016
^ AlphaGo’s Designers Explore New AI After Winning Big in China by Cade Metz, Wired, May 27, 2017
^ AlphaGo Zero: Learning from scratch by Demis Hassabis and David Silver, DeepMind, October 18, 2017
^ David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, Yutian Chen, Timothy Lillicrap, Fan Hui, Laurent Sifre, George van den Driessche, Thore Graepel, Demis Hassabis (2017). Mastering the game of Go without human knowledge. Nature, Vol. 550
^ David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis (2017). Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm. arXiv:1712.01815
^ Fine Art (software) from Wikipedia
^ Two stones! Fine Art defeated Ke Jie 9P after giving two stones handicap. – Website of The International Go Federation, January 19, 2018
^ Go Servers at Sensei's Library - Fox Weiqi
^ Breakthrough: Fine Art beating Ke Jie with 2 Handicap Stones by Ingo Althöfer, Computer Go Archive, January 20, 2018
^ 7% Documentary: Behind the scenes of Fine Art AI - 纪录片《7%》：揭秘人工智能“绝艺”夺冠幕后腾讯网 - English subtitles, YouTube Video
featuring Fine Art team Liu Yongsheng, Ma Bo, Tang Shanmin, Wu Guangyu and Zhang Kaixu
further Rémi Coulom, Simon Viennot, I-Chen Wu, Hideki Kato, David Fotland, Shun-Chin Hsu et al. at the Computer Go UEC Cup 2017
^ Re: Chess vs Go // AI vs IA by Gian-Carlo Pascutto, June 02, 2010
^ Computer Go Bibliography, University of Alberta
^ GoTools - TsumeGo Solving Software
^ Gobble
^ Mathematical Go from Sensei's Library
^ Nici Schraudolph’s go networks, review by Jay Scott
^ EZ-GO at Sensei's Library
^ Tsumego at Sensei's Library
^ steganography from Wikipedia
^ The Shodan Go Bet
^ Re: Teaching Deep Convolutional Neural Networks to Play Go by Erik van der Werf, The Computer-go Archives, December 15, 2014
^ Capturing race from Wikipedia
^ Franz-Josef Dickhut from Wikipedia, Rémi Coulom
^ codecentric go challenge 2014: Interviews with Franz-Josef Dickhut and Rémi Coulom - codecentric Blog by Raymond Georg Snatzke, October 1, 2014
^ codecentric go challenge 2014: Final Interviews - codecentric Blog by Raymond Georg Snatzke, November 27, 2014 (German)
^ How Facebook’s AI Researchers Built a Game-Changing Go Engine | MIT Technology Review, December 04, 2015
^ Combining Neural Networks and Search techniques (GO) by Michael Babigian, CCC, December 08, 2015
^ Re: Minmax backup operator for MCTS by Brahim Hamadicharef, CCC, December 30, 2017
^ The Mystery of Go, the Ancient Game That Computers Still Can’t Win by Alan Levinovitz, Wired, May 12, 2014
^ Wired Article on Computer GO by Edmund Moshammer, CCC, May 13, 2014
^ World #1 Go Player Ke Jie accepts Google Alpha Go Match.. by AA Ross, CCC, June 07, 2016
^ Ke Jie from Wikipedia

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
1st Computer Olympiad	Jul 25, 2017
20th Computer Olympiad	Feb 5, 2018
2nd Computer Olympiad	Jul 12, 2017
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
5th Computer Olympiad	Jan 17, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
9th Computer Olympiad	Jul 22, 2017
AI Factory	Dec 26, 2015
Akihiro Kishimoto	Jan 22, 2018
Alan Blair	Jan 22, 2018
Alan Frank	Dec 19, 2016
Alan Turing	Feb 8, 2017
Albert Zobrist	Jun 12, 2016
Alex B. Meijer	Aug 31, 2014
Alexander Bitman	Jun 2, 2015
Alexander Schmidt	May 17, 2016
Alfred Knöpfle	Jan 19, 2017
Algorithms	May 5, 2017
AlphaZero	Feb 10, 2018
Amine Bourki	Jan 19, 2016
Amos Storkey	Jan 23, 2017
Anders Kierulf	Dec 28, 2016
Arpad Rimmel	Mar 16, 2016
Artificial Intelligence	Apr 9, 2018
Aske Plaat	Jun 26, 2017
BBC Micro	Dec 16, 2016
Bernard Helmstetter	May 23, 2016
Bernd Brügmann	Jul 30, 2016
Bert Enderton	Sep 16, 2012
Bojun Huang	Jan 22, 2018
Broderick Arneson	Jan 8, 2017
Bruce Wilcox	Sep 24, 2014
Bruno Bouzy	Aug 12, 2017
Chang-Shing Lee	Jul 18, 2017
Cheng-Wei Chou	Jul 17, 2017
Chess	Jan 21, 2018
ChessBase Best-Publication Awards to Include	Jan 7, 2017
Ching-Nung Lin	Jul 17, 2017
Chris J. Maddison	Dec 8, 2017
Christophe Fiter	Jan 19, 2016
Christopher Clark	Jan 23, 2017
Complexity to include	Jun 16, 2011
Csaba Jergler	Dec 18, 2016
Daniel Shawul	Jan 28, 2018
David Forsyth	May 2, 2011
David Fotland	Jan 6, 2017
David J. Wu	Jan 28, 2016
David Silver	Feb 11, 2018
David Wolfe	Jun 25, 2015
Dawei Du	Dec 28, 2016
Deep Learning	Feb 12, 2018
DeepMind	Dec 9, 2017
Demis Hassabis	Dec 8, 2017
Dharshan Kumaran	Dec 9, 2017
Don Dailey	Dec 7, 2016
Ed Northam	Sep 4, 2016
Edward de Grijs	Dec 30, 2016
Elwyn Berlekamp	Jun 25, 2015
Engine Rating Lists	Dec 13, 2017
Erik Bernhardsson	Jan 22, 2017
Erik van der Werf	Dec 31, 2016
Fabien Letouzey	Feb 5, 2018
Feng-hsiung Hsu	Dec 27, 2016
Fridel Fainshtein	Oct 8, 2014
Games	Feb 20, 2018
Gary Boos	Apr 10, 2013
Gary Linscott	Jan 16, 2018
Genetic Programming	Dec 26, 2017
Gerald Tesauro	Dec 13, 2016
Gian-Carlo Pascutto	Jan 16, 2018
Go	Jan 24, 2018
Go (Programming Language)	Nov 2, 2017
Gosu	Dec 7, 2017
GPU	Dec 16, 2017
Guan-Wun Chen	Jul 19, 2017
Guillaume Chaslot	Jan 2, 2017
Gunnar Farnebäck	Jan 23, 2017
Hank Dietz	May 3, 2011
Harm Geert Muller	Mar 31, 2018
Haruhiro Yoshimoto	Jun 25, 2013
Hassen Doghmen	Mar 16, 2016
Hendrik Baier	Jan 22, 2018
Henk Koppelaar	Aug 31, 2014
Hideki Kato	Jan 6, 2017
Hiroshi Yamashita	May 28, 2017
Historical Examples	Jan 16, 2017
Hung-Jui Chang	Jul 16, 2017
I-Chen Wu	Sep 19, 2017
Ian Osgood	Jun 14, 2013
ICGA	Jul 8, 2017
ICGA Journal	Dec 21, 2017
Ilya Sutskever	Jan 28, 2017
Jaap van den Herik	Sep 18, 2017
Jahn-Takeshi Saito	Jan 2, 2017
James Kerwin	Sep 24, 2014
Janusz Kraszek	Jan 17, 2017
Jean-Baptiste Hoock	Jan 2, 2017
Jean-Loup Gailly	Nov 27, 2011
Jean-Yves Audibert	Apr 29, 2015
Jeng-Chi Yan	Dec 28, 2016
Jinqiang Lu	Jan 17, 2017
Joe Leslie-Hurd	Aug 15, 2013
Johan de Koning	Jul 3, 2017
John Hamlen	Jul 12, 2017
John Tromp	Jan 6, 2017
Jonathan Rosenthal	Jan 9, 2018
Jos Vermaseren	Jan 12, 2016
Joshua Shriver	Nov 24, 2017
Judith Spencer Olson	Sep 24, 2014
Julian Schrittwieser	Dec 7, 2017
Julien Pérez	Jan 19, 2016
Julio César Hernández-Castro	Sep 3, 2015
Junichi Hashimoto	Jan 4, 2017
Jürg Nievergelt	Dec 28, 2016
Kai Laskos	Jan 21, 2018
Katsuki Ohto	Aug 11, 2017
Keh-Hsun Chen	Jan 16, 2017
Kenta Sasaki	Jun 24, 2011
Kiyoshi Shirayanagi	May 23, 2016
Kokolo Ikeda	Mar 15, 2016
Kuo-Yuan Kao	Jul 22, 2017
Kurt Keutzer	Jul 9, 2016
Lars Schaefers	Dec 30, 2017
Laurent Sifre	Dec 7, 2017
LCZero	Apr 18, 2018
Learning	Feb 20, 2018
Levente Kocsis	Dec 23, 2016
Ling Zhao	Jun 24, 2015
Louis Chatriot	Jan 19, 2016
Marcin Szubert	Dec 13, 2014
Mark Boon	Dec 15, 2016
Mark Watson	Apr 14, 2013
Markus Enzenberger	May 23, 2016
Martin Müller	Aug 12, 2017
Mathematician	Apr 9, 2018
Matthew Lai	Dec 6, 2017
Matthieu Coulm	Oct 22, 2010
Matthieu Walraet	Jul 10, 2016
Mei-Hui Wang	Jul 17, 2017
Michael Reiss	Dec 15, 2016
Mikko Aarnos	Mar 14, 2015
Ming-Cheng Cheng	Jul 22, 2017
Monte-Carlo Tree Search	Apr 26, 2018
National Chiao Tung University	Jul 23, 2017
National Taiwan University	Jul 21, 2017
Nebiyu	Dec 10, 2017
Neural Networks	Mar 12, 2018
Nicol N. Schraudolph	Jan 23, 2017
Noah Weninger	Aug 13, 2017
Nobuo Araki	Jan 3, 2017
Nobusuke Sasaki	Jan 19, 2016
Olivier Teytaud	Jan 7, 2017
Oxford Softworks	May 6, 2013
Parallel Search	Dec 30, 2017
Peigang Zhang	Jan 2, 2017
Personal Computing	Dec 27, 2017
Peter Dayan	Feb 10, 2018
Peter H. Jin	Jul 9, 2016
Petr Baudiš	Dec 9, 2017
Phantom Go	Jun 29, 2017
Ping-Chiang Chou	Jul 17, 2017
Playing Strength	Mar 31, 2018
ProbCut	Mar 25, 2016
Proof-number search	Jan 22, 2018
Pseudorandom number generator	May 11, 2017
Quote McCarthy	Sep 10, 2013
Raghuram Ramanujan	Dec 26, 2017
Raymond Georg Snatzke	May 26, 2015
Rémi Coulom	Feb 5, 2018
Rémi Munos	Dec 8, 2017
Richard Sutton	Feb 20, 2018
Robert Nado	Sep 24, 2014
S. Ali Mirsoleimani	Jan 15, 2016
Scorpio	Mar 28, 2018
Shang-Rong Tsai	Jan 7, 2017
Shi-Jim Yen	Jul 22, 2017
Shih-Chieh Huang	Oct 18, 2017
Shinichi Sei	Jan 3, 2017
Shivkumar Shivaji	Oct 24, 2017
Shogo Takeuchi	Jun 16, 2016
Shun-Chin Hsu	Jul 22, 2017
Shun-Shii Lin	Jan 21, 2017
Stephen B. Streater	Dec 17, 2016
Sumudo Fernando	May 27, 2014
Sylvain Gelly	Dec 31, 2016
TAAI	Dec 8, 2014
Takanari Shishido	Jan 19, 2016
Takeshi Ito	Jan 6, 2017
TCGA 2011	Dec 8, 2014
TCGA 2012	Jan 21, 2017
Terrence J. Sejnowski	Jan 24, 2017
Thomas Hérault	May 11, 2013
Thomas Hubert	Dec 7, 2017
Thomas Thomsen	Mar 25, 2015
Thomas Wolf	Sep 18, 2017
Thore Graepel	Jan 10, 2018
Ti-Rong Wu	Jul 19, 2017
Timothy Lillicrap	Dec 9, 2017
Ting-Fu Liao	Jul 19, 2017
Ting-Han Wei	Jul 19, 2017
Tobias Graf	Jul 8, 2016
Tristan Cazenave	Jan 22, 2018
Tsan-Cheng Su	Jan 8, 2017
UCT	Jan 22, 2018
Ulf Lorenz	Dec 22, 2016
University of Paderborn	Aug 17, 2014
Vincent Danjean	Nov 18, 2012
Walter Knöpfle	Jan 19, 2017
Walter R. Reitman	Sep 24, 2014
WMCCC 2000	Feb 27, 2018
Wojciech Jaśkowski	Dec 13, 2014
Workshop Chess and Mathematics	Mar 5, 2015
x86-64	Mar 6, 2018
Yasushi Tanase	Jan 1, 2017
Yizao Wang	Dec 31, 2016
Yoji Ojima	Dec 3, 2016
Zen	Aug 4, 2016
Zhixing Chen	Jan 17, 2017
Zillions of Games	May 29, 2017
Łukasz Lew	Jun 9, 2015

Up one Level

Wikispaces : chessprogramming - items matching description

Amazons

Table of Contents

Computer Olympiads

Selected Programs

Photos

Maastricht 2002

Yokohama 2013

Branching Factor

Selected Publications

1999

2000 ...

2005 ...

2010 ...

2015 ...

External Links

Game

Misc

References

What links here?

Arimaa

Table of Contents

Arimaa Pieces

Publications

2003 ...

2005 ...

2010 ...

2015 ...

Forum Posts

External Links

References

What links here?

Atomic Chess

Table of Contents

Atomic Check

Engines

Publications

Forum Posts

External Links

References

What links here?

Awari

Table of Contents

Rules

Computer Olympiads

See also

Selected Publications

1989

1990 ...

2000 ...

Forum Posts

External Links

References

What links here?

Backgammon

Table of Contents

Computer Olympiads

Photos

Evaluation

Learning

Publications

1977 ...

1980 ...

1985 ...

1990 ...

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

Forum Posts

External Links

Computer Backgammon

Backgammon Programs

References

What links here?

Bao

Table of Contents

Bao 0.1

See also