Author: Russell Reagan
Date: 05:58:30 01/08/04
Go up one level in this thread
On January 07, 2004 at 22:55:36, Ed Trice wrote: >I think one objective measure is the size of the game, or the branching factor >of the game tree. It is, but it is not always a good measure. See below. >Go is a very large game (I think it is 19 squared factorial) so that has to be >up there in terms of difficulty. The main reason that go is such a hard game for computers is that it is more difficult to create an evaluation function that is accurate. Go does have a high branching factor compared to chess (361 from the opening position), but there are games with much higher branching factors that computers play very well. Amazons, for instance, has a branching factor of 2176 from the starting position, but computers have been able to beat the best humans for a long time now (AFAIK).
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.