Sure, glad to help. I hope the following answers your question.
PatSolve -E -M96 solves it in 50 moves
bfs-020 solves it in 37 moves
#000536 Attempt: 1 NumFcs=4 (BFS Solver)
5d 68 5c 5c 6b 65 b5 45 6b 4a
16 46 7h 24 16 74 34 35 36 b6
26 d4 24 2d 3b 3h 84 74 37 13
23 87 8h 12 c3 1c 81
This is probably optimal for an atomic-move solution. (I could run
bfs-500, which takes 1.5 hours per deal, but I don't think its optimal
solution will be any shorter.)
I didn't list the fc-solve results because it is (primarily) designed
for speed, and lists every move in its solution -- including automatic
moves to home. I just wrote a "translator" program that removes the
automatic moves to home for PatSolve solutions, but I still need to
write one for fc-solve.
If you have more questions about specific deals, you can contact me
directly: dajones at inreach dot com . That way, others in the group
won't get upset.
WKRfresno_at_aol.com wrote:
> What do you get for MS deal 536? I can solve it in 65 moves using all
> legal
> moves. Anything less I run out of space. But I haven't tried to solve
> it in
> less than 60 moves.
> Bill Raymond
Received on Tue Sep 09 2003 - 11:49:58 IDT