*Knight's Tour*.

A Knight's move is as in chess, an L shaped move, 2 squares in one direction and 1 square in the other direction.)

A Knight's Tour is one where the knight passes through each square exactly once.

You may start on any square you wish.

* For extra credit, come up with a *re-entrant* tour: at the end, the knight is exactly one knight's move away from the starting square.

* For EXTRA extra credit, make sure that the path is, in some way, symmetrical.

_______________________

Since "Knight's Tour" is a term used outside the scope of this problem, I'm sure you can find an answer on the internet. Please find an independent solution.

This does *not* require a computer program.