Gunno Toernberg tells me he has been working on a computer approach
to the problem: you can see his endeavours at: http://w1.859.telia.com/~u85905224/knight/eknight.htm
where you can have ago on his Java board.
Comments on: Martin Loebbing and Ingo Wegener, The Number of Knight's
Tours Equals 33,439,123,484,294 --- Counting with Binary Decision
Comment by the authors, May 15, 1996:
The number of knight's tours given in the paper is incorrect, since