Author: Uri Blass
Date: 23:32:24 11/15/03
Go up one level in this thread
On November 15, 2003 at 23:42:40, Derek Paquette wrote: >On November 15, 2003 at 22:09:51, Mike Byrne wrote: > >>On November 15, 2003 at 22:02:42, stuart taylor wrote: >> >>>I believe there are supercomputers that are much much faster than was the IBM >>>which beat Kasparov with Deeper Blue. >>>If so, what are we waiting for? >>>S.Taylor >> >>Even much faster computers will not solve chess. The possibilies of chess games >>exceeds the number of atoms in the universe and by the time it could even be >>theoretically solved, the Sun would have burned out and there will no humans >>living on earth. So one can safely say , chess will never be solved (white to >>move and win) by man using computers. >> >>That would not prevent a computer perhaps being the best in the world. > >This gives an indication of how many legal chess moves there are at each ply, > >2ply = 1,600 >3ply = 64,000 >4ply = 2,560,000 >5ply = 102,400,000 >6ply = 4,096,000,000 >7ply = 163,840,000,000 >8ply = 6,553,600,000,000 >9ply = 262,144,000,000,000 >10ply = 10,485,760,000,000,000 >11ply = 419,430,400,000,000,000 >12ply = 16,777,216,000,000,000,000 >13ply = 671,088,640,000,000,000,000 >14ply = 26,843,545,600,000,000,000,000 >15ply = 1,073,741,824,000,000,000,000,000 >16ply = 42,949,672,960,000,000,000,000,000 >17ply = 1,717,986,918,400,000,000,000,000,000 >18ply = 68,719,476,736,000,000,000,000,000,000 >19ply = 2,748,779,069,440,000,000,000,000,000,000 >20ply = 109,951,162,777,600,000,000,000,000,000,000 This is totally irrelevant even if we assume 40 positions per move(practically in most cases there is less than it). Even a program like tscp that prunes nothing except using simple alpha beta that means only pruning lines that are obviously bad lines has branching factor of less than 10. Hash tables that tscp does not use and killer move that it does not use can also help to get better branching factor. Another point is that the fact that you prune moves does not mean that your pruning is wrong and it is possible that a program will solve chess by correct rules to prune moves and the fact that moves are possible does not say that there are no correct rules to say that they are not logical. I do not expect it to happen in my life but you cannot prove that it is impossible. Uri
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.