I was just playing some solitaire (the card game version) and realized that I come across the situation where the game becomes unbeatable quite a lot. This got me onto thinking about if we knew where every card was, would we be able to beat every game with a certain set of moves? Now, I tried conjouring up a counter example but after a few failed attempts I gave up and decided to turn to something a little more 'mathy'. The thing is though, I've never done this kind of thing before and I really have no idea where I would start off (or I'd even be able to.. I've got that 'mathematical maturity' the books always talk about and I know my way about set theory etc but idk if that's enough).(adsbygoogle = window.adsbygoogle || []).push({});

So my questions are as follows

1) Has this been done before? If so, links?

2) If no one knows of it being done before, could anyone point me in the right direction as to how to get started?

Thanks in advance!

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Are games of solitaire always beatable?

Loading...

Similar Threads - games solitaire always | Date |
---|---|

About the strategy of reducing the total suffering in a queue | Dec 28, 2017 |

I Shopping List Game: Probability Question | Dec 10, 2017 |

I Stochastic Minimax partition problem card game | Sep 1, 2017 |

I Battle Projections | Jun 28, 2017 |

What is the probability of winning a game of solitaire? | Mar 19, 2006 |

**Physics Forums - The Fusion of Science and Community**