Author: Uri Blass
Date: 09:25:18 12/23/00
Go up one level in this thread
On December 23, 2000 at 09:01:29, Joshua Lee wrote: >this is over a google and even if your program could search at 5 trillion nodes >per second it wouldn't solve chess in your lifetime. > > 64^64 is one number that comes to mind 3.9402006196394479212279040100144e+115 The number of leagl positions is clearly smaller than 64^64. I do not understand why do you think about 64^64. Uri
This page took 0.01 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.