Author: Uri Blass
Date: 06:11:04 02/22/05
Go up one level in this thread
On February 22, 2005 at 07:38:09, Tord Romstad wrote: >Are you sure? It sounds very unlikely to me. I am too lazy to do any >calculations right now, but I think solving 9x9 go should be roughly as >difficult as solving chess. > >Tord easy to see that 3^81<10^40 so it seems that it is easy to find smaller upper bound for the number of possible positions in go (I do not know an easy proof that there are less than 10^40 positions in chess). 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.