On Mon, Sep 13, 2010 at 12:35 PM, Olivier Teytaud <[email protected]> wrote: > ... there's a known undecidability result (by Bob Hearn) stating that a game > with > - finite state > - two teams (with no communication) > - unbounded horizon > can be undecidable. The undecidable question is > "is there a strategy for winning with probability 1 in situation X". > and an instance is a position X.
I would be interested in a reference to this result. _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
