BrainKing - 讨论板 (Chess variants (10x8))

Chess variants (10x8)

Sam has closed his piano and gone to bed ... now we can talk about the real stuff of life ... love, liberty and games such as
Janus, Capablanca Random, Embassy Chess & the odd mention of other 10x8 variants is welcome too

For posting:
- invitations to games (you can also use the New Game menu or for particular games: Janus; Capablanca Random; or Embassy)
- information about upcoming tournaments
- disussion of games (please limit this to completed games or discussion on how a game has arrived at a certain position
... speculation on who has an advantage or the benefits of potential moves is not permitted while that particular game is in progress)
- links to interesting related sites (non-promotional)

讨论板列表

状态: 所有人能发表

先显示最旧的消息。

5. 八月 2004, 23:10:02

Chessmaster1000

显示此用户所有帖子 | 链接

题目: Solving Chess.

被Chessmaster1000修改(5. 八月 2004, 23:12:00)

<>To solve chess, a computer the size of the universe is needed. There is a very famous >paper on this, I forget where it is. There are more chess positions than atoms in the >universe, so with "information density" such that a solution to one position could fit on >one atom (an impossibility) you would need a universe to solve chess.

This is wrong for 2 reasons:

A)You don't have to store the solution somewhere. You just have to find it and then play it.

B)It is possible that a set of strategic rules can be found which ensure a win for one of the players or a draw for both. If the correctness of these rules can be proven, it is not necessary to evaluate a large number of positions, to obtain the result of the game if both players play correctly. (Victor Allis)
For example at Connect 4 7x6, there are about 1.6·10^13 position possible so to store all these positions we would need 4 TB, but the game has been solved and the program that plays perfect Connect 4 7x6 is only 2.5 MB.