On Sat, 2008-10-11 at 16:32 -0400, Michael Williams wrote: > Don Dailey wrote: > > Are there any MC programs out that cannot detect whether they made a one > > stone capture and it would be unduly difficult to fix this? > > They would have to detect that to detect simple Ko.
That's a good point. > > Speaking of which, wouldn't it be better to limit consecutive Kos instead of > limiting consecutive 1-stone captures? Wouldn't this definitely slow down most if not all light implementations and require code changes to existing programs? My own programs do not really know that a ko exists until it decides to make that specific move. Then when it tries to play that move the make() routine discovers that it is was a ko and reject it, returning an illegal move value. To fix this I would have to test every move just to see if there is a ko situation (although there are no doubt some shortcuts.) So I don't think that is a practical rule although it is without doubt slightly superior. - Don > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/
signature.asc
Description: This is a digitally signed message part
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
