On Wed, Oct 8, 2008 at 3:46 PM, Don Dailey <[EMAIL PROTECTED]> wrote: > Is there any way to prove that with best play the game cannot end in > seki?
It seems like most reasonable sequences in Chinese rules 4x4 go end in a whole-board seki. I would expect that for 19x19 go, some avenues of best play can also lead to seki, because the perfect-play game tree is likely to be immense, and seki is common in 19x19 games (the larger the board, the greater the number of groups that could possibly end in seki). I do not have any proof, and I think a proof either way would be extremely difficult to do. I think a proof would also be very difficult (nearly as bad as solving the empty board) for 9x9. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
