Changes

Jump to navigation Jump to search
156 bytes added ,  19:39, January 25, 2016
add a note on a different concept of solving games with some chance elements
Line 7: Line 7:  
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]].
 
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 (game)|go]] and [[chess]].
+
Obviously, games with elements of luck or chance cannot be solved in this context. For example, the board game "Risk" cannot be solved, because it uses dice. However, even in games with elements of chance, it can still be possible to calculate a strategy that maximizes the likelihood of winning.  Games with no luck that have not been solved include [[go (game)|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.<ref>http://www.msnbc.msn.com/id/19839044/</ref>
 
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.<ref>http://www.msnbc.msn.com/id/19839044/</ref>
Block, SkipCaptcha, Automoderated users, edit, rollback
3,135

edits

Navigation menu