"Peter Hendriks" <p.j.hendriks@[EMAIL PROTECTED]
> writes:
> Have fun with the new puzzle (and the old ones if you wish).
>
> direct link: http://home.planet.nl/~p.j.hendriks/p186e.htm
"""
B··B····
BBBB····
B··B····
········
········
····W··W
····WWWW
····W··W
The eight white horses in the bottom right corner of the chess board
are bosom friends. You will always find them in eachothers close
vincinty. Together they are going to move to the top left corner of
the board, where eight black horses are quietly waiting to be
captured. The white horses move over the board as it behooves horses
(or knights in proper chess terminology) to move in chess. There is a
restriction though. The white horses can only jump to so called safe
squares. A square is safe if it is surrounded by at least two white
horses, and not yet occupied by another white horse. For example:
square g3 is surrounded by Kf2, Kg2, Kh2 and Kh3, and is a safe square
for Ke2 and Kh1.
What is the minimal number of moves required to have all black horses
replaced by white ones?
"""
Ignoring the constraint, each horse can reach a destination square
in 3 hops, for 24 in total. I've not checked to see how much the
constraint affects things.
I notice that the constraint does not forbid leaving a horse stranded
on is own, to later hop back into a safe square. I do not know if
that twist affects things either.
> Please answer by email and not in this newsgroup.
I could understand that comment if you only publicised your puzzles
by e-mail. Except of course that I couldn't understand it as I
wouldn't even receive it. Now that's a puzzle.
Phil
--
"Home taping is killing big business profits. We left this side blank
so you can help." -- Dead Kennedys, written upon the B-side of tapes of
/In God We Trust, Inc./.
|
