A Magic Tour is a tour where, if you number each square with the corresponding knight's step, the result *is* a magic square.

A Semi-Magic Tour is a tour where, if you number each square with the corresponding knight's step, the result *is* a semimagic square.

(A magic square, as you may already know, is one in which the respective sums of the numbers in all the rows, columns, and long diagonals, add up to the same number -- whereas -- a semimagic square is one in which the respective sums of the numbers in all the rows, columns, but not necessarily the diagonals, add up to the same number.)
__________________________

The problem:
Find a Magic Tour, on a standard 8x8 chessboard, or prove that it is impossible.

If you find that is is impossible, find a Semimagic Tour, on a standard 8x8 chessboard or prove that it is impossible. Show your work!

So, the first square the knight is on, is marked (1). The next square the knight jumps to is marked (2), and so on... until (64).

* For extra credit, make sure that, at the end, the knight is exactly one knight's move away from the starting square.
_______________________

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 may require a computer program (hence the category).

This problem is in algorithms, which means an algorithm or program is a good idea to include; the solution would not be complete without it.

SilverKnight assures me that there is a program that will give a quick solution (one in less than the 60 some days it took) or else this wouldn't be flooble related. The point of this problem would be to find such restrictions that are needed.