I finally got my code working. Here is the output (0 is the lower
left corner, 31 is upper right).
Even though the results are the same for some sequences, my program
adds ALL the possibilities to the move list, and then finds the
results in the hash table when it later evaluates the duplicates. It
makes the move (using a different path), then realizes the position
has already been evaluated (the board is the same). Do all programs
do this, or is there a way to quickly detect this?
When I enter this position into simple checkers, it claims no moves at
all! I may be using it incorrectly, so if someone else could double
check this I would appreciate it. Do most programs handle these wierd
positions and generate all possible moves correctly?
Red to move:
. . . .
. . . .
b b b .
. . . .
b b b .
. . . .
b b b .
RK . . .
0 x 9 x 2 x 11 x 18 x 9 x 16 x 25 x 18 x 27
0 x 9 x 2 x 11 x 18 x 25 x 16 x 9 x 18 x 27
0 x 9 x 2 x 11 x 18 x 27
0 x 9 x 16 x 25 x 18 x 9 x 2 x 11 x 18 x 27
0 x 9 x 16 x 25 x 18 x 11 x 2 x 9 x 18 x 27
0 x 9 x 16 x 25 x 18 x 27
0 x 9 x 18 x 11 x 2 x 9 x 16 x 25 x 18 x 27
0 x 9 x 18 x 25 x 16 x 9 x 2 x 11 x 18 x 27
0 x 9 x 18 x 27
On Wed, 29 Sep 2004 10:04:58 -0700, Quantum Anenome
<QuantumAnenome@[EMAIL PROTECTED]
> wrote:
>I'm writing a checkers program, and had a question about jumping.
>When doing multiple jumps, are the opponent's checkers removed after
>each jump, preventing situations where you can double back to get more
>jumps in?
>Also, if you end up in a loop back to your original sqaure (or any
>other sqaure you've already been to in a loop), do you still get to
>continue jumping?
>
>Say if you have a king in the lower left corner, and there are 9
>opponents arranged in a grid ready for jumping, what are all the
>possible options? Can all 9 be jumped?
>
>Thanks,
>Chris
>
|
