nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW
6,781
edits
Changes
Jump to navigation
Jump to search
Line 7:
Line 7: − +
games of chance cannot be solved
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.
Games that have not been solved include [[go]] and [[chess]].
Obviously, games with elements of luck or chance cannot be solved. For example, Risk cannot be solved, because it uses dice. Games with no luck that have not been solved include [[go]] and [[chess]].
[[Category:Games]]
[[Category:Games]]