# Solved game

### From Conservapedia

A **solved game** is a two-player game in which it is known what the theoretical result of the game should be.

A game can be solved on several levels. A game can be "ultra-weakly solved", which means that the theoretical result of the game from the first position, given best play (win, lose, or draw for the first player) is known, but there is no specific algorithm known for bringing about this result. Right now, checkers is ultra-weakly solved, but computers are working on weakly solving it.^{[1]}

If a game is "weakly solved", the theoretical result of the game from the beginning is known, and an algorithm for bringing about this result is known. In other words, it is known exactly what moves need to be made to bring about this result. An example of a weakly solved game is Connect Four (with a modified 15 by 15 board rather than a standard board. The game is strongly solved under a standard sized board).

In a "strongly solved game", an algorithm for bringing about the theoretical result of the game can be produced from *any* position in the game, not just the opening position. An example of a strongly solved game is tic-tac-toe.

Obviously, games with elements of luck or chance cannot be solved. For example, the board game "Risk" cannot be solved, because it uses dice. Games with no luck that have not been solved include go and chess.

Since 2007, checkers has been considered to be a solved game since a computer called Chinook determined in 2007 that the game is a draw with best play from both sides.^{[2]}