Heya! Looks like it needed ~506million states

• Moves: 151
• States: 505,748,485
• Time: 1002109ms = 16:42.109
• Steps: HG @AD @AG @@AG @AL @@@@@@AL @AL @@@@@AG @AG AG @@@@@AJ @@@@@AJ HJ @AH FH @@@AF @@AF @@@@@AF KF KD KB KH KI LH HL JH LJ LH LK LC LB LE GE GB IE GE IB @AB @@@@AC JC @AD JD GD JE JB JI JL @AC JC GC IC AL AD GD GC AE @AC @AE GE IG IB GB GE FE HB GB FB HC GC GB ID JD KD KE FE FB HD HC GC LD LE HD

Thanks...I tried running the code again using '-S 510000000' but it has been running for 1.5 hours without a solution.

You must have some extremely powerful hardware to generate the solution in under 17 minutes.

Please provide some guidance to create a command line that will generate the solution or confirm that a solution will be generated if I let the code continue executing for sufficient duration.

You just need more RAM really, pretty sure the max you could do on your machine is around 250 million states with only 16gb. I have 64gb on mine which allows for a little over a billion. I may try to add other faster methods that don't guarantee minimality, but am preoccupied with other items at the moment.

Here's another GreenFelt deal that is solvable but MinimalKlondike was unable to solve with '-S 300000000' :

klondike -S 300000000 422286211

Thanks in advance for posting the steps, time, moves and states required.

• Moves: 145
• States: 426,618,002
• Time: 880,918ms
• Steps: JI @@@@@AI @@@@@@AK @AL AL AK @@AJ KJ KD @AI @@AH @@@AB @@AL @@AC AF @@@AD @@@AL @AK JK AF HF @@@AJ HJ HE @AJ LJ AL FL AJ AH LH AF JF JB JB LB LH KL AJ KJ KI IK IC FC KC KB IE IK LI LD FD FC FB IC IB KD LE GE HE HD HC HB KE FE IE HE IB IE KD FD KC FC FB FE JE IB FB KD HD GD @AC HC HD HE JD IC FC IB