[Magictour] a1-a2

Well, 1.6x10^12 nodes is a huge number. I hope other tours won't take 32 =
hours to finish !
BTW, the program performed at an average speed of 14 millions of nodes =
per second :-)

On my 1.7Ghz Athlon, I started a4-d4, and found 3 solutions for the =
moment:

[Fri Jun 27 12:48:45 2003]
Solution 1: =
a4-b2-d1-c3-b5-a7-c6-d8-e6-f8-h7-g5-e4-f2-h1-g3-e2-g1-h3-f4-h5-g7-e8-f6-d=
7-b8-a6-c5-d3-c1-a2-b4-d5-c7-a8-b6-c4-a3-b1-d2-f3-e1-g2-h4-g6-h8-f7-e5-g4=
-h2-f1-e3-f5-h6-g8-e7-c8-d6-b7-a5-b3-a1-c2-d4 found in 8797740 =
milliseconds (45069237008 nodes)
Solution 2: =
a4-b2-d1-c3-b5-a7-c8-d6-c4-a3-b1-d2-e4-f2-h1-g3-h5-f6-e8-g7-f5-e7-g8-h6-g=
4-h2-f1-e3-d5-c7-a8-b6-d7-b8-a6-c5-e6-f8-h7-g5-h3-g1-e2-f4-g2-e1-f3-h4-g6=
-h8-f7-e5-d3-c1-a2-b4-c6-d8-b7-a5-b3-a1-c2-d4 found in 8968476 =
milliseconds (45983796526 nodes)
Solution 3: =
a4-b2-d1-c3-b5-a7-c8-d6-e8-f6-h7-g5-e4-f2-h1-g3-e2-g1-h3-f4-h5-g7-e6-f8-d=
7-b8-a6-c5-d3-c1-a2-b4-d5-c7-a8-b6-c4-a3-b1-d2-f3-e1-g2-h4-g6-h8-f7-e5-g4=
-h2-f1-e3-f5-h6-g8-e7-c6-d8-b7-a5-b3-a1-c2-d4 found in 9058836 =
milliseconds (46490056718 nodes)

It is checking a4-b4, c3-c4 and c4-e5, and should have finished monday.

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