Counterexample to MinimalKlondike solution

[clemente213]

Hello ShootMe

I discovered a counterexample to MinimalKlondike finding the fewest possible moves for any deal, including unsolvable deals. The link is https://greenfelt.net/klondike?game=2095819838.

MinimalKlondike finished the search with a score of 10 in 54 moves. The "high scores" button shows a score of 10 in 53 moves. This may be a trivial counterexample but I thought you might be interested. It is my understanding that MinimalKlondike performs an exhaustive search of all possible moves. In this particular case, a move was saved by not playing the 4-hearts onto the 5-clubs.

Thanks to MinimalKlondike, the skills that I have acquired improve daily and the joy that I experience playing Klondike exceeds my expectations.

[ShootMe]

Yea this is known. The solver is minimal for solvable deals. However, the way it checks states can cause it to produce sub optimal results for impossible deals since the heuristics it uses assumes a solvable deal. Don't know if I could change that without making the solving time extremely slow.