Author: Uri Blass
Date: 06:12:57 12/01/02
Go up one level in this thread
On December 01, 2002 at 08:49:24, Gian-Carlo Pascutto wrote: >On December 01, 2002 at 07:42:42, Uri Blass wrote: > >>What is the maximal size of the board when go is solved by computers? > >5x5, it was done using pretty much standard alpha-beta search > >>Are there tablebases for endgames that go programs use? > >No, the board fills up instead of getting empty, so I don't >see a way to make EGTBs. > >-- >GCP I thought about tablebases based on the empty squares but I see that the problem is that the position is not defined only by the empty squares. Maybe it can be done to help to solve 6*6 go because when x pieces are missing there are at most 2^(36-x) positions that are available. When x=1 you need to remember the score for 36*2^35 positions that is already hard and I guess that it is not going to help to solve the game of go because I guess that usually the game is finished when there is more than one empty square(I have no expereince in go so I do not know). It may be possible to use symmetry to reduce that number but it still seems to be impossible task for the Micro computers of today. Uri
This page took 0.02 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.