Siteadmin, Check users, nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW, oversight, Administrators
30,650
edits
Changes
mLine 7:
Line 7: − +
go (game)
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, Risk cannot be solved, because it uses dice. Games with no luck 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 (game)|go]] and [[chess]].
[[Category:Board games]]
[[Category:Board games]]