Hi all,
I have designed a variant, using a custom deck, of patience/solitaire & whilst I believe it is solveable I was wondering if anyone knows how you can test that it is actually able to be solved without playing millions of hands? I have played it about 50 times so far & managed to get some games where I could hardly move a card & some where I got a fair way in before the hand locked up, both of which match my normal play of the standard game. One game I managed to get all the cards out except for one group but actually getting the whole game out has eluded me.
Any tips/hints please?
Thanks
Sean
Thanks for those responses. The game has hidden elements similar to the old fashioned (original?) patience but I should've thought about just flipping them up for testing because if it can be solved when I can see the cards then theoretically it can be solved when the cards are hidden if the play makes the right choices. Man I'm slow sometimes.
I will also ask around at school & see if I can find a programmer that would like a challenge. Again, something that I failed to think of.
Thanks again