I recently modified my BFS solver to process more moves by pruning
entries as the tree became full. As such, there's no longer a guarantee
that a solution is the shortest; but it at least provides shorter
solutions than I'm able to obtain otherwise. Here's an updated solution
for the game with the longest solution that I've encountered in the
first 100M games.
#94717719 Attempt: 1 NumFcs=4 (BFS Super) 84 moves
13. 6a. 56. 5b. 52. 51. 57. 5c. 65_ b6.
78_ 4b. 7d. 72. 78. 74. a7. 12_ 67_ 62.
6a. 64. c6. a6. 1a. 1c. 14. 13. 12. a1.
62_ 32_ 31. 3a. 34. 36. 36. d3. 5d. 5h.
7h. bh. 83_ 2b. 75. 7h. 25. 65_ 24_ 36_
37. a3. 67_ 86. 8a. 8h. 81. 82. 36_ 76_
16_ 28. 2h. 1h. 21. 2h. 7h. 27. 2h. 3h.
48_ 41_ 47_ 42_ 46. c6. 4c. d4. 23_ 2a.
2b. 2h. 2d. 26.
~~~~~
(.) -->> single card move
(_) -->> multiple card move (supermove)
Regards, Danny A. Jones
Received on Tue Apr 30 2013 - 22:21:57 IDT