Solved game

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A solved game is a game whose outcome (win, lose, or draw) can be correctly predicted from any position, given that both players play perfectly. Games which have not been solved are said to be "unsolved". Games for which only some positions have been solved are said to be "partially solved". This article focuses on two-player games that have been solved.


A two-player game can be "solved" on several levels:[1][2]


Prove whether the first player will win, lose, or draw from the initial position, given perfect play on both sides. This can be a non-constructive proof (possibly involving a strategy-stealing argument) that need not actually determine any moves of the perfect play.


Provide an algorithm that secures a win for one player, or a draw for either, against any possible moves by the opponent, from the beginning of the game. That is, produce at least one complete ideal game (all moves start to end) with proof that each move is optimal for the player making it. It does not necessarily mean a computer program using the solution will play optimally against an imperfect opponent. For example, the checkers program Chinook will never turn a drawn position into a losing position (since the weak solution of checkers proves that it is a draw), but it might possibly turn a winning position into a drawn position because Chinook does not expect the opponent to play a move that will not win but could possibly lose, and so it does not analyze such moves completely.


Provide an algorithm that can produce perfect play (moves) from any position, even if mistakes have already been made on one or both sides.

Despite the name, many game theorists believe that "ultra-weak" are the deepest, most interesting and valuable proofs. "Ultra-weak" proofs require a scholar to reason about the abstract properties of the game, and show how these properties lead to certain outcomes if perfect play is realized.[citation needed]

By contrast, "strong" proofs often proceed by brute force—using a computer to exhaustively search a game tree to figure out what would happen if perfect play were realized. The resulting proof gives an optimal strategy for every possible position on the board. However, these proofs aren't as helpful in understanding deeper reasons why some games are solvable as a draw, and other, seemingly very similar games are solvable as a win.

Given the rules of any two-person game with a finite number of positions, one can always trivially construct a minimax algorithm that would exhaustively traverse the game tree. However, since for many non-trivial games such an algorithm would require an infeasible amount of time to generate a move in a given position, a game is not considered to be solved weakly or strongly unless the algorithm can be run by existing hardware in a reasonable time. Many algorithms rely on a huge pre-generated database, and are effectively nothing more.

As an example of a strong solution, the game of tic-tac-toe is solvable as a draw for both players with perfect play (a result even manually determinable by schoolchildren). Games like nim also admit a rigorous analysis using combinatorial game theory.

Whether a game is solved is not necessarily the same as whether it remains interesting for humans to play. Even a strongly solved game can still be interesting if its solution is too complex to be memorized; conversely, a weakly solved game may lose its attraction if the winning strategy is simple enough to remember (e.g. Maharajah and the Sepoys). An ultra-weak solution (e.g. Chomp or Hex on a sufficiently large board) generally does not affect playability.

Moreover, even if the game is not solved, it is possible that an algorithm yields a good approximate solution: for instance, an article in Science from January 2015 claims that their heads up limit Texas hold 'em poker bot Cepheus guarantees that a human lifetime of play is not sufficient to establish with statistical significance that its strategy is not an exact solution.[3][4][5]

Perfect play[edit]

In game theory, perfect play is the behavior or strategy of a player that leads to the best possible outcome for that player regardless of the response by the opponent. Based on the rules of a game, every possible final position can be evaluated (as a win, loss or draw). By backward reasoning, one can recursively evaluate a non-final position as identical to that of the position that is one move away and best valued for the player whose move it is. Thus a transition between positions can never result in a better evaluation for the moving player, and a perfect move in a position would be a transition between positions that are equally evaluated. As an example, a perfect player in a drawn position would always get a draw or win, never a loss. If there are multiple options with the same outcome, perfect play is sometimes considered the fastest method leading to a good result, or the slowest method leading to a bad result.

Perfect play can be generalized to non-perfect information games, as the strategy that would guarantee the highest minimal expected outcome regardless of the strategy of the opponent. As an example, the perfect strategy for Rock, Paper, Scissors would be to randomly choose each of the options with equal (1/3) probability. The disadvantage in this example is that this strategy will never exploit non-optimal strategies of the opponent, so the expected outcome of this strategy versus any strategy will always be equal to the minimal expected outcome.

Although the optimal strategy of a game may not (yet) be known, a game-playing computer might still benefit from solutions of the game from certain endgame positions (in the form of endgame tablebases), which will allow it to play perfectly after some point in the game. Computer chess programs are well known for doing this.

Solved games[edit]

Awari (a game of the Mancala family)
The variant of Oware allowing game ending "grand slams" was strongly solved by Henri Bal and John Romein at the Vrije Universiteit in Amsterdam, Netherlands (2002). Either player can force the game into a draw.
See "Draughts, English"
The second player can always force a win.[6]
Connect Four
Solved first by James D. Allen (Oct 1, 1988), and independently by Victor Allis (Oct 16, 1988).[7] First player can force a win. Strongly solved by John Tromp's 8-ply database[8] (Feb 4, 1995). Weakly solved for all boardsizes where width+height is at most 15[7] (Feb 18, 2006).
Draughts, English (Checkers)
This 8×8 variant of draughts was weakly solved on April 29, 2007 by the team of Jonathan Schaeffer, known for Chinook, the "World Man-Machine Checkers Champion". From the standard starting position, both players can guarantee a draw with perfect play.[9] Checkers is the largest game that has been solved to date, with a search space of 5×1020.[10] The number of calculations involved was 1014, which were done over a period of 18 years. The process involved from 200 desktop computers at its peak down to around 50.[11]
Weakly solved by Maarten Schadd. The game is a draw.
Free Gomoku
Solved by Victor Allis (1993). First player can force a win without opening rules.
Solved by Alan Frank using the Official Scrabble Players Dictionary in 1987.
  • A strategy-stealing argument (as used by John Nash) will show that all square board sizes cannot be lost by the first player. Combined with a proof of the impossibility of a draw this shows that the game is ultra-weak solved as a first player win.
  • Strongly solved by several computers for board sizes up to 6×6.
  • Jing Yang has demonstrated a winning strategy (weak solution) for board sizes 7×7, 8×8 and 9×9.
  • A winning strategy for Hex with swapping is known for the 7×7 board.
  • Strongly solving hex on an N×N board is unlikely as the problem has been shown to be PSPACE-complete.
  • If Hex is played on an N × N+1 board then the player who has the shorter distance to connect can always win by a simple pairing strategy, even with the disadvantage of playing second.
  • A weak solution is known for all opening moves on the 8×8 board.[12]
Most variants solved by Geoffrey Irving, Jeroen Donkers and Jos Uiterwijk (2000) except Kalah (6/6). The (6/6) variant was solved by Anders Carstensen (2011). Strong first-player advantage was proven in most cases.[13][14]
L game
Easily solvable. Either player can force the game into a draw.
Maharajah and the Sepoys
This asymmetrical game is a win for the sepoys player with correct play.
Strongly solved.
Nine Men's Morris
Solved by Ralph Gasser (1993). Either player can force the game into a draw.[15]
Weakly solved by humans, but proven by computers. (Dakon is, however, not identical to Ohvalhu, the game which actually had been observed by de Voogt)
Strongly solved.[16] The first player wins.
Weakly solved by H. K. Orman.[17] It is a win for the first player.
Solved by Luc Goossens (1998). Two perfect players will always draw.
Weakly solved by Oren Patashnik (1980) and Victor Allis. The first player wins.
Renju-like game without opening rules involved
Claimed to be solved by János Wagner and István Virág (2001). A first-player win.
Weakly solved: win for the second player.
Solved by Guy Steele (1998). Depending on the variant either a first-player win or a draw.[18]
Three Men's Morris
Trivially solvable. Either player can force the game into a draw.
Three Musketeers
Strongly solved by Johannes Laire in 2009. It is a win for the blue pieces (Cardinal Richelieu's men, or, the enemy).[19]
Trivially solvable. Either player can force the game into a draw.
Tigers and Goats
Weakly solved by Yew Jin Lim (2007). The game is a draw.[20]

Partially solved games[edit]

Solved by retrograde computer analysis for all three- to six-piece, and some seven-piece endgames, counting the two kings as pieces. It is solved for all 3–3 and 4–2 endgames with and without pawns, where 5–1 endgames are assumed to be won with some trivial exceptions (see endgame tablebase for an explanation). The full game has 32 pieces. Chess on a 3×3 board is strongly solved by Kirill Kryukov (2004).[21] It has been speculated that solving chess may be impossible with current technology.[22]
All positions with two through seven pieces were solved, as well as positions with 4×4 and 5×3 pieces where each side had one king or fewer, positions with five men versus four men, positions with five men versus three men and one king, and positions with four men and one king versus four men. The game was solved in 2007 by Ed Gilbert of the United States. Computer analysis showed that it was highly likely to end in a draw if both players played perfectly.[23]
The 5×5 board is weakly solved for all opening moves.[24] Humans usually play on a 19×19 board which is over 145 orders of magnitude more complex than 7×7.[25]
It is trivial to show that the second player can never win; see strategy-stealing argument. Almost all cases have been solved weakly for k ≤ 4. Some results are known for k = 5. The games are drawn for k ≥ 8.
Reversi (Othello)
Weakly solved on a 4×4 and 6×6 board as a second player win in July 1993 by Joel Feinstein.[26] On an 8×8 board (the standard one) it is mathematically unsolved, though computer analysis shows a likely draw. No strongly supposed estimates other than increased chances for the starting player (Black) on 10×10 and greater boards exist.

See also[edit]


  1. ^ V. Allis, Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of Computer Science, University of Limburg, 1994. Online: pdf
  2. ^ H. Jaap van den Herik, Jos W.H.M. Uiterwijk, Jack van Rijswijck, Games solved: Now and in the future, Artificial Intelligence 134 (2002) 277–311.
  3. ^ "Heads-up limit hold’em poker is solved". doi:10.1126/science.1259433. 
  4. ^ Philip Ball (2015-01-08). "Game Theorists Crack Poker". Scientific American. Nature. doi:10.1038/nature.2015.16683. Retrieved 2015-01-13. 
  5. ^ Robert Lee Hotz (2015-01-08). "Computer Conquers Texas Hold 'Em, Researchers Say". Wall Street Journal. 
  6. ^ "How to Always Win Chopsticks". wikiHow. Retrieved 28 April 2013. 
  7. ^ a b John's Connect Four Playground
  8. ^
  9. ^ Schaeffer, Jonathan (2007-07-19). "Checkers Is Solved". Science. Retrieved 2007-07-20. 
  10. ^ "Project - Chinook - World Man-Machine Checkers Champion". Retrieved 2007-07-19. 
  11. ^ Mullins, Justin (2007-07-19). "Checkers 'solved' after years of number crunching". news service. Retrieved 2007-07-20. 
  12. ^ P. Henderson, B. Arneson, and R. Hayward[, Solving 8×8 Hex ], Proc. IJCAI-09 505-510 (2009) Retrieved 29 June 2010.
  13. ^ Solving Kalah by Geoffrey Irving, Jeroen Donkers and Jos Uiterwijk.
  14. ^ Solving (6,6)-Kalaha by Anders Carstensen.
  15. ^ Nine Men's Morris is a Draw by Ralph Gasser
  16. ^ Geoffrey Irving: "Pentago is a first player win"
  17. ^ Hilarie K. Orman: Pentominoes: A First Player Win in Games of no chance, MSRI Publications – Volume 29, 1996, pages 339-344. Online: pdf.
  18. ^ Teeko, by E. Weisstein
  19. ^ Three Musketeers, by J. Lemaire
  20. ^ Yew Jin Lim. On Forward Pruning in Game-Tree Search. Ph.D. Thesis, National University of Singapore, 2007.
  21. ^ 3×3 Chess by Kirill Kryukov.
  22. ^ See Solving chess
  23. ^ Some of the nine-piece endgame tablebase by Ed Gilbert
  24. ^ 5×5 Go is solved by Erik van der Werf
  25. ^ Counting legal positions in Go, Tromp and Farnebäck, accessed 2007-08-24.
  26. ^ 6×6 Othello weakly solved

Further reading[edit]

  • Allis, Beating the World Champion? The state-of-the-art in computer game playing. in New Approaches to Board Games Research.

External links[edit]