There are $140$ distinct semimagic knight tours on a normal chessboard ($8\ \times\ 8$).
 A semimagic knight tour is a knight tour (not necessarily closed) such that a
 semimagic square appears if the numbers 1 to 64 in increasing order are written down where the knight starts for the next move. It is known that there is no solution with correct diagonal sums. For more details search with google with the words "magic knight tour" and click on the first hit.

I tried to generate them with turbo pascal, but it is a hard task because there
 are so few solutions. 

I also do not know a complete list of the tours. So my
 questions are :

* Is there a semi-magic knight tour for any starting square ?
* If yes, can a given tour be transformed in another one with different
starting square ? (Unfortunately, replacing 1 by 2, 2 by 3 and so on and
finally 64 by 1 does not work because the board does not stay semiagic)