enough, also visited every cell once and only once in the fewest
possible straight lines until he finally reached the man's cell. They
started together and went at the same speed; yet, although they
occasionally got glimpses of one another, they never once met. The
puzzle is to show the route that each happened to take.


325.--AN EPISCOPAL VISITATION.

The white squares on the chessboard represent the parishes of a diocese.
Place the bishop on any square you like, and so contrive that (using the
ordinary bishop's move of chess) he shall visit every one of his
parishes in the fewest possible moves. Of course, all the parishes
passed through on any move are regarded as "visited." You can visit any
squares more than once, but you are not allowed to move twice between
the same two adjoining squares. What are the fewest possible moves? The
bishop need not end his visitation at the parish from which he first set
out.


326.--A NEW COUNTER PUZZLE.

Here is a new puzzle with moving counters, or coins, that at first
glance looks as if it must be absurdly simple. But it will be found
quite a little perplexity. I give it in this place for a reason that I
will explain when we come to the next puzzle. Copy the simple diagram,
enlarged, on a sheet of paper; then place two white counters on the
points 1 and 2, and two red counters on 9 and 10, The puzzle is to make
the red and white change places. You may move the counters one at a time
in any order you like, along the lines from point to point, with the