Bill Raymond enticed me into the world of solving 8x0 deals and I
thought I was doing well -- until I encountered #1003256. For the
longest time, this deal was just one of several Intractable deals that
I'd encountered while searching for solvable 8x0 deals. Then, I
accidentally stumbled upon a configuration for my solver that produced
a solution.
If you get bored sometime, you might give it a try. Below is the only
solution I've been able to generate. (Unfortunately, I misplaced the
configuration.)
The first listing uses periods ('.') to indicate single card moves and
underscores ('_') to indicate multi-card moves. When multiple cards
are moved, the most possible are always moved. Standard (Horne) MS
FreeCell auto-move logic is used.
The second listing is a conversion of the first solution that's
suitable for the 'Load' feature in FcPro26.
#01003256 Attempt: 1 NumFcs=0 (Pri Multi) 88 moves
71. 2h. 86. 84. 78. 72. 7h. 3h. 37. 35.
38. 35. 75. 31_ 67. 63. 62. 68. 67. 64.
36. 76_ 56_ 13. 1h. 6h. 18. 1h. 15. 42_
41. 34. 82_ 42_ 48. 13_ 81_ 41. 48. 21_
23_ 13_ 12_ 18. 68_ 64_ 17. 14. 67_ 84_
87_ 47_ 48_ 21. 31_ 32. 34_ 24. 23_ 43.
42_ 13_ 12. 51_ 53. 54. 76. 56. 57. 16_
78_ 31_ 35. 3h. 8h. 2h. 8h. 2h. 8h. 2h.
8h. 2h. 8h. 8h. 15_ 2h. 21_ 27.
#01003256 Attempt: 1 NumFcs=0 (CVT FcPro) 132 moves
71 2h 86 84 78 72 7h 3h 37 35
38 35 75 31 67 63 62 68 67 64
36 76 57 53 73 56 36 13 1h 6h
18 1h 15 42 41 34 87 83 73 82
32 42 48 17 13 73 81 41 48 27
24 74 21 41 27 24 74 23 43 17
14 74 13 43 17 14 74 12 42 18
68 67 64 74 17 14 67 84 87 47
48 21 36 34 64 31 41 32 36 34
64 24 23 43 42 16 14 64 13 43
12 56 51 61 53 54 76 56 57 16
78 35 31 51 35 3h 8h 2h 8h 2h
8h 2h 8h 2h 8h 8h 15 2h 28 21
81 27
Danny A. Jones
Received on Fri Feb 18 2005 - 18:07:19 IST