Don Dailey wrote:
There is no need to explore every cycle to get your proof.
Long cycles are a good example where one can start by making a weak solution. Just change your presuppositions. Invent a long cycle rule like "A play recreating the position after 4+ plays ends the game (or your game tree branch of proof-play) immediately and exceptionally with the result tie.". You could even write 3+ instead of 4+; it would not be human-friendly (traditional) in a sending-2-returning-1 then but you don't care. Or add another rule: "Ko-capturing in a basic ko is prohibited." Or use the Fixed-ko-rule. Then you can study Go without ko fights and solve it first. You avoid all your cycle worries! Worried about big captures? Make yet another presupposition: "It is prohibited to make a play that captures more than X stones." When you will have solved Go under these simplifications, you can still release your restrictions iteratively. Start with X=0, then X=1, then X=2,...
-- robert jasiek _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
