Author: Tord Romstad
Date: 07:34:54 02/22/05
Go up one level in this thread
On February 22, 2005 at 09:11:04, Uri Blass wrote: >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. > >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 It is not entirely trivial to compute a good upper bound for the number of positions in 9x9 go, I am fairly sure the number must be bigger than 3^81. In addition to the board state, you must also consider the number of captured pieces for both sides, the side to move, and the state of ko fights. On the other hand, you can reduce the number of positions by a factor of 8 by considering symmetries. You may be right that the number is significantly smaller than for 8x8 chess, but I still think both games are likely to be far too complicated to be solved by computers in our lifetime. Tord
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.