[Magictour] Final tours

Hugues just finished the a3-b5 tour and verified that there are 8 solutions:
http://www.novatex.net/mt/

I'm currently at my work, so I can't check them, but I'll do that as soon as
I'll be at home (in 10 or so hours).
Now, he should have recomputed ALL the known solutions.

Although Gunter suggested interesting advances, I recommend to not modify the
current program, since it works (it's an important programming law: if it
works, don't touch it !). However, it could be interesting to write a second
independent program (thus different) in order to verify if we didn't miss any
solution.

About the tours, I think that the 8*12 could be reachable with a computer
search, but we'll have to use a different approach from the start/end we
currently use, or it could work if we have plenty of computers that are never
shut down.

JC

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