>> Is a hint to the proven ambiguity of whichever Japanese ruleset good enough for you?
> > http://home.snafu.de/jasiek/**j1989c.html<http://home.snafu.de/jasiek/j1989c.html> > http://home.snafu.de/jasiek/**wagcflaw.html<http://home.snafu.de/jasiek/wagcflaw.html> > http://home.snafu.de/jasiek/j_verbal_status.pdf > Thanks for the links; I know that Japanese rules are a kind of oral tradition more than a really formalized game. But an undecidability of the phantom-version would be great :-) For example, the EXP-completeness of Go with Japanese rules (Robson's proof) holds for a subset of the game for which there's no ambiguite (just a big ko-fight plus plenty of non-ambiguous widgets). I'd bet there is an undecidability for something similar in the phantom case. It would be sufficient, for proving this, to encode a 2-player deterministic finite state machine in a ko-fight. Would be nice, because it would be the first important real world game with undecidability (as far as I know). Best regards, Olivier
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
