JC wrote: I can build a 7x7 magic torus program, if somebody is interested.
GPJ: I'm interested. It would be more interesting if you could select out
some examples with special properties, say approaching pandiagonality, or
showing H-supersymmetry (that is 7 cells in the shape of an H add to the
constant).
JC: Second, I wrote a program to solve the non-crossing variant of knight
tours. When testing it on the 9x9 board, I had a good surprise. On my site:
http://euler.free.fr/knight/ the best known solution to the 9x9 board is 43
moves (although I typed 45, but I don't have any 45 moves solution).
GPJ: According to my notes M.Matsuda published a 47-move solution in J.Rec
Maths 1969 (vol.2 no.3). Your note stimulated me to finish processing the
article by Robin Merson that appeared in G&PJournal no.17 in 1999. This is
now on the KTN website in the Recreations section at the bottom of the index
page. Direct access is: http://www.ktn.freeuk.com/2b.htm.
Magictour mailing list
To unsubscribe: mailto:magictour-request@ml.free.fr?subject=unsubscribe
To mail to the mailing list: mailto:magictour@ml.free.fr
Received on Thu Dec 04 14:24:18 2001
This archive was generated by hypermail 2.1.8 : jeu. août 14 2003 - 00:22:15 W. Europe