The Bishop's Path

Try to solve this puzzle on your own, and then play through for the
answer --no peeking! :)

In only seventeen moves, have the Bishop visit every White square.
Squares may be visited more than once, but the Bishop is not allowed to
move twice between the same two adjoining squares.
(The Bishop's initial square is given as having been visited already)
This browser is not Java-enabled.


[ Home | Problems & Puzzles | Sounds | Links ]

1