Changes

A '''solved game''' is a two-player game in which it is known what the theoretical result of the game. For example, [[checkers]] is 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. <ref>http://www.msnbc.msn.com/id/19839044/</ref>

A '''solved game''' is a two-player game in which it is known what the theoretical result of the game should be. For example, [[checkers]] is 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. <ref>http://www.msnbc.msn.com/id/19839044/</ref>

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. <ref> http://www.cs.ualberta.ca/~mmueller/ps/ijcai05checkers.pdf</ref>

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. <ref> http://www.cs.ualberta.ca/~mmueller/ps/ijcai05checkers.pdf</ref>