Don Dailey wrote: > I think the proof tree for both sides
can avoid those nearly infinite loops. I do agree that there are some practical difficulties to doing this and being able to claim it's a proof.
One might start with a weak solution that makes some presuppositions like "Never play inside a two-eye-formation.".
-- robert jasiek _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
