Canfield (solitaire card game) checker

[pryrt]

I have been feeling rather deprived of Perl activity the last few months... so when I was playing a card game on my phone (a simple one that I have >95% win rate on), but had spent quite a few attempts (it allows undo/restart), I decided to program in as much of the "deal" as I could see, and see if I could get Perl to find a route to one or more of the as-of-yet unseen reserve cards (at which point, I'd be able to try to move forward and maybe even win this hand).

Canfield_(solitaire) variant:

• Infinite times through the stock
• Stock is 1-at-a-time (not the default 3-at-a-time)
• Foundations always start at Ace
• Tableau alternates color, descending, but allows wrapping from 2-A-K

With that, I hacked together a solver that gave a 50% chance at every "decision point", then went through thousands of games. It was never able to find a path to reveal the next card (the first ? in the deal), so I'm pretty confident that this particular deal isn't winnable.

I figured I might as well share this CUFP, even if it's not overly groundbreaking (and definitely not great code).

<Reveal this spoiler or all in this thread>