Version: 4.2.2 (using KDE 4.2.4) Installed from: Ubuntu Packages The attached two images show two positions in a Simple Simon game. The solver reports one as "yes, can win" and the other as "no, can't win" when you can easily move backwards and forwards between them by moving the 6,7,8 of spades.
Created attachment 34853 [details] not winnable
Created attachment 34854 [details] not winnable
Thanks for the report, but if you're able to reproduce the issue, could you please attach saved games instead of screen shots. This makes it much easier for developers to recreate the scenario.
Created attachment 34872 [details] saved game
My guess is that this bug occurs when it's necessary to break up a sequence (in this case, the 6 - K of Spades) in order to solve it. The solver doesn't consider this possibility. I just had the bug occur again where this was necessary. As soon as you manually break the sequence (move the 6,7,8 over), it can find the solution.
you will have to help me here - I'm unable to solve that savegame. Please describe some more moves - preferably till the solver catches up again.
8s -> 9h 5d -> 6s 7c -> empty 7d -> 8d 9d -> empty 9c -> 10c 10c -> empty 10s -> js 10c -> jd qs -> empty 7h -> 8h 8h -> empty 6c -> 7c 9d -> 10d 10d -> empty 6d -> 7d 6d -> 6d 8s -> 9s 4s -> empty 5c -> 6c 4c -> 5c jc -> qc I'll let you figure it out from there :)
ok, solver knows how to win after 4th move. So I just need him to find these 4 moves :)
hmm, letting the solver take all possible moves into account is easy, but I wonder how this case is different from all the other sequences not to be uselessly split ;(
*** Bug 308175 has been marked as a duplicate of this bug. ***
Created attachment 134259 [details] Example from 20.04.3 Figured I'd add an example from a more recent version (20.04.3) that I played through to solved before creating the save. The "unsolvable" condition occurs at move 25.
Between 2009 and 2020 the simple simon solver was replaced and so the old bug is no longer relevant. For the latest comment, this is a fc-solve bug: coolo@Kellerfenster:~/kpat> cat t 4S 7C 7D KH QD JS AC 4H JD QS 8S 4C 3S 2D AD 5S QH 4D 6D 2S TS 3C 2C AS TD TC 3H 2H 5C 3D 8C 9C JH TH 9S 8D 7S 6S AH KC QC JC KD KS 6C 5D 9H 8H 7H 6H 5H 9D coolo@Kellerfenster:~/kpat> fc-solve -g simple_simon t I could not solve this game. Total number of states checked is 3. This scan generated 3 states. It doesnt' see that moving the "3H 2H" to the empty stack will make it winnable again.
Created attachment 184377 [details] Example from kpatience 23.08.0 simple simon Resolvable game - solver told from beginning that it is unresolvable resp. lost.