Changes

Jump to navigation Jump to search
4 bytes added ,  10:09, August 19, 2014
no edit summary
Line 5: Line 5:  
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).
 
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.
+
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. 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]].
Block, SkipCaptcha, Upload, Automoderated users, delete, edit, rollback
7,537

edits

Navigation menu