Eight chess knights, four white and
four black, are placed on the special G-chessboard
as shown in the Start diagram above left. Now,
performing just normal knight’s moves from cell to cell
of the chessboard, exchange the white and black knights
as shown in the Goal diagram above right. Knights can
leap to vacant cells only. Counting a consecutive series
of leaps of a knight as one move, can you exchange the
knights in exactly eleven moves?
To move a knight simply click it first; then click a
chosen free cell which the knight should move to. Use
"Undo" and "Redo" for the respective backward and
forward moves of knights on the board in accordance with
your solution. Once you solve the puzzle, or have some
particular sequence of moves, you can use "Undo" and
"Redo" to check all your moves. The Labels button can be
helpful to check and note down your solution.
In Wei-Hwa Huang's Puzzle Challenge
Number 8 by Google (posted on July 14, 2006), he posed
six different challenges on letter-shaped chessboards
which form a stylized Google logo; see below. Some of
these challenges were based on my G-Knights Exchange
puzzle proposed above.
The six chess puzzles of Wei-Hwa's Puzzle Challenge Number 8 by Google.