Thanks everyone for the responses. My go skills are somewhat limited (only
6-7kyu on KGS) so hopefully I am not belaboring the obvious.
I have a few followup questions-
1) What mathematically is a seki? I know this is a local draw but can it be
determined statically at some point in all cases using some sort definition
without placing stones on the board (i.e. searching). I only know of three
cases here- the 1 eye each case with one shared liberty. two shared liberties
and the half eye situation.
2) I am guessing hash maps get quite large if they are exhaustive. i.e. (nxn)^3
can quickly become quite big. Or do they tend to be sparsely populated?
3) GTP and time management and scoring after two passes. Are these issues
discussed anywhere? Do libraries like Orego and Libgo contain code that already
does this which can be used as a reference?
Thanks again,
Carter.
____________________________________________________________________________________
Be a better friend, newshound, and
know-it-all with Yahoo! Mobile. Try it now.
http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
