Re: computer-go: 5x5 Go is solved?

[John Tromp <John.Tromp@xxxxxx>]

> More I think about it, more I am convinced, that something like this
> should already be possible for 5x5 Go with todays hardware-possibilities
> and that it would be a very funny thing for every Go player to
> "surf around" in such a database.

such a database could be made quite small in fact.
fix a standard go program, like gnugo.
assume that the program can order all legal moves (plus pass)
in a position from 0, 1, ... up to k-1, supposedly from best to worst.
then if move 0 really is an optimal move, we don't store this position in
the database. if the first optimal move is number i, then we add
an entry for this position mapping it to i.
the stronger the program, the smaller the database.

figuring out the result of a position is now just a matter of playing it
out with help of the database, until there are 2 consecutive passes.

actually, gnugo is not the most suitable for this purpose. maybe some
custom program can be made to do much better...

regards,

%!PS                       %  -John Tromp (http://www.cwi.nl/~tromp/)
42 42 scale 7 9 translate .07 setlinewidth .5 setgray/c{arc clip fill
setgray}def 1 0 0 42 1 0 c 0 1 1{0 3 3 90 270 arc 0 0 6 0 -3 3 90 270
arcn 270 90 c -2 2 4{-6 moveto 0 12 rlineto}for -5 2 5{-3 exch moveto
9 0 rlineto}for stroke 0 0 3 1 1 0 c 180 rotate initclip}for showpage