Author: Jay Scott
Date: 14:11:49 01/03/03
Go up one level in this thread
On January 02, 2003 at 06:03:58, Edward Seid wrote: >10. Go-Moku (15x15) 10^105 10^70 Go-moku is a good example that shows how a big state space and big tree-size do not necessarily imply that the game is difficult to solve. The game was solved long ago as a win for the first player, and extra rules have been added to try to keep the game interesting. It is also a win for the first player on an infinite board, which has an infinitely large state space.... If the state space or tree-size is small, the game can be solved by exhaustive search. But if they are both big, the game may still be solved by a cleverer search, or by a mathematical proof such as a symmetry argument. People who think that the large state-space of go shows that it is a difficult and interesting game have come to the right conclusion for the wrong reason. Jay
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.