Sure, I'm always glad to be helpful!
Deals #58, #224, and #378 can be solved in 28 moves. Deal #255 can be
solved in 57 moves and deal #454 takes 58 moves.
#000224 Attempt: 1 NumFcs=4 (BFS Solver) 28 moves
4d 41 84 7c 7b 2h 67 27 57 54
5a 57 3a 35 3h a5 35 15 85 35
87 1a 15 3h 6h 63 81 73
#000225 Attempt: 1 NumFcs=4 (BFS Solver) 57 moves
24 2d 2c 2b 2a 25 62 76 72 52
a2 1a 16 d6 1d 12 17 d2 42 3d
8h 81 51 87 48 43 46 a8 4a ah
5h dh 4d 7a 24 2h 7h 3h 76 56
5h 5h 7h 8h 6h 75 2h 1h 6h 37
1h 6h 3h 67 6h 6h 6h
#000454 Attempt: 1 NumFcs=4 (BFS Solver) 58 moves
3d 38 3c 4b 43 c3 43 4c 42 4a
a4 b4 14 1b 1a 13 14 c4 74 14
54 71 73 2c 21 c1 21 7c b7 5b
25 21 27 85 4h 2h 6h 3h 82 b2
8b 6h 87 b7 d8 3d 31 61 68 c1
61 3c 3b 36 b6 c6 3c 3b
I hope you get your solver fixed and cranking out great solutions real
soon! Maybe you can then supply me with a list of "difficult" deals. I
hope so.
I started writing my BFS solver several months back and then threw
everything away because it wasn't coming together the way I wanted. But,
I was "hooked" and a month later I started over from scratch. My
original objective was to find optimal path solutions, but I sure wish
my solver would produce answers faster.
My next project is to try a prioritized-descent method to find
respectably short solutions in significantly less time than my current
solver. I don't expect to produce solutions at the speeds of FreeCell
Solver or PatSolve; but it was never my objective to compete with them,
anyway.
(Please don't ask me to define "respectably". Ha-Ha)
WKRfresno_at_aol.com wrote:
> Hi. I've reorganized much of my solver and it appears to be broken. Can
> always go back to the old version, but for now would you name a few
> games 1-500
> that can be solved in 28 moves ( and possibly print out a solution to
> one of
> them), and name some games that require 58 moves?
> Thanks,
> Bill Raymond
Received on Thu Sep 04 2003 - 12:33:23 IDT