[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [computer-go] Solved boards



Alejandro Lujan wrote:

I understand small boards (up to 5x5 or so) are solved problems. Does anybody
have any information regarding go programs taking advantage of this situation?

Each solution in itself is only valid for one boardsize. I doubt that small-board solutions can be used to play well on larger boards (like with the fractal Go idea). However, the techniques used to solve the small empty boards can be applied to larger (non-empty) boards.

In particular, Im interested in knowing if GnuGo uses this information on a 5x5
board (what would make it impossible to beat it playing white, right?)

Not AFAIK. Although it could be done, at least for very slow games, I don't think the Gnugo developers are interested in such a thing.

BTW, it is not necessary to solve the game to play perfect, it is only needed if you want to be completely sure. I would not be surprised to find that (maybe after some additional tuning) Gnugo's heuristic play is good enough to be unbeatable after starting with black in the center on 5x5.

Erik

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/