All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Knight Moves (Posted on 2004-12-10)
The diagram shows a restricted chess board with three black knights and three white knights. Your goal is to move the pieces so that the same squares are occupied but the colors are reversed. Your first move must use a black piece.

Pieces may move only as a normal chess knight, from one corner of a 2×3 rectangle to the opposite corner. No more than one piece may occupy a single square at a time. No piece may move onto a darkened square. No other rules of chess apply.

One turn is a sequence of moves made by a single piece. Find a solution with the minimum number of turns.

 No Solution Yet Submitted by DJ Rating: 3.1250 (8 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 One computer solution | Comment 3 of 10 |

One of several computer solutions that are being devoloped is:

A4-B2
E2-C3
C3-A4
B1-C3
D2-B1
C3-E2
D5-C3
E2-D4
B1-D2
B4-D5
C3-B1
D5-C3
C3-E2
B1-C3
C3-D5
D5-B4
E2-C3
D2-B1
C3-D5
B1-C3
C3-E2
D5-C3
C3-B1
B1-D2
A4-C3
B2-A4
C3-B1
A4-C3
C3-D5
E2-C3
C3-A4
D4-E2

This has 32 moves.  If I've counted right, there are 9 instances where the sending square on a given move is the same as the receiving square on the previous (indicating a continued move by the same knight), making it 23 turns.

Edited on December 10, 2004, 9:22 pm
 Posted by Charlie on 2004-12-10 21:19:39

 Search: Search body:
Forums (0)