summary |
shortlog | log |
commit |
commitdiff |
tree
first ⋅ prev ⋅ next
Mark Wooding [Sun, 12 Mar 2006 16:28:51 +0000 (16:28 +0000)]
cp: Tweak guess selection algorithm: minimize largest bin.
The computer player analyses guesses by trying each possible guess
prototype and dividing the remaining code candidates into bins according
to the possible ratings for the guess.
Previously, we'd choose the guess which minimizes the square-sum of the
bin sizes. This change makes it choose the guess which minimizes the
size of the largest bin.
This is simpler to compute (it can be done in integers -- the least
squares code used doubles to avoid overflow). Unfortunately, the play
is somewhat poorer, even though it's often faster.
Mark Wooding [Sun, 12 Mar 2006 17:26:54 +0000 (17:26 +0000)]
mm: Add built-in option for running an internal tournament.
Mark Wooding [Sun, 12 Mar 2006 17:02:30 +0000 (17:02 +0000)]
mm: Add a `quiet' flag to suppress normal thinking noise.
Mark Wooding [Sun, 12 Mar 2006 17:02:29 +0000 (17:02 +0000)]
Various small whitespace cleanups.
Mark Wooding [Thu, 2 Mar 2006 14:58:22 +0000 (14:58 +0000)]
Initial import.