|
From: | Michael Petch |
Subject: | Re: [Bug-gnubg] Handling ambiguous checker moves |
Date: | Thu, 09 Apr 2009 14:56:22 -0600 |
User-agent: | Microsoft-Entourage/12.15.0.081119 |
Last from me.
Your example is essentially saying that gnubg should pick the interpretation that maximizes the user's chance of winning, as if that is surely what he intended. This is certainly one possible algorithm.
However, another algorithm is to never interpret a continuous slide as pick and pass.
I prefer the latter, but the important thing is that there be some method that program consistently follows.
[Prev in Thread] | Current Thread | [Next in Thread] |