Freecell Windows 7
Ryan Rhinehart
Apparently, in recent versions of Microsoft Windows FreeCell on Windows 10, the deal number display there is misleading for the "Random" deals. This appears to be a bug in MS FreeCell. One can instruct it to deal a numbered deal, or alternatively input the cards' layout into the web-based solver manually using the text notation.
We can recommend that you try PySol FC ( ) instead, which shares some maintainers with Freecell Solver, and which is FOSS (see _and_open-source_software ) and gratis and should run fine on Windows and other platforms.
Note: The animated and graphical display is not currently available for the variants of Solitaire which do not match the default 8-columns and 4-freecells Freecell variant ( Reference) with limited sequence move-length, tableau built by alternate colours, and empty columns that can be filled by any card.
This is a web-based interface to Freecell Solver, that was translated from the C source code to JavaScript, by using the emscripten LLVM bit-code to JavaScript compiler. Like Freecell Solver itself, this JavaScript port is open-source software under the permissive MIT/Expat licence.
Firebug - a web development tool for Firefox, that provides a JavaScript debugger, a CSS manipulation tool, DOM introspection and more. (The Opera web browser's Opera Dragonfly does something similar for Opera, and is also useful.)
Alon Zakai - writing emscripten, the LLVM-to-JavaScript compiler that was used to prepare this page, based on the original C (gnu99) source, and answering some bug reports and questions I filed about it.
Unless noted otherwise, the text and other creative media of the pages of this site is licensed under the Creative Commons Attribution 3.0 Unported License (or at your option any later version). The markup and code of this site are, unless noted otherwise, licensed under the MIT/Expat licence.
Webmaster: Shlomi Fish. He can be contacted using many electronic means, and while he can be reached using email (shl...@shlomifish.org and shl...@gmail.com), more reliable messaging means such as XMPP or IRC are preferable. .
So, solved it 2-3 times without getting the achieve (first time it crashed on me, WTG MS). I w ent and documented the steps I took as I took them, using Undo when I fell into a trap or to catch what card was auto-played to the foundation.
At this point, the table should clear, you should get a win, and you might unlock the achievement. If not, try replaying a few times. Just like every windows phone game out there, Microsoft just phoned it in, so it may get glitch, but it should still be attainable.
The achievement is glitchy. I had to beat the board 4 times. I think what you have to do is do it completely using your phone and without leaving the screen. That means no going back to the menu and no letting you screen go dark. The first time I completed the board without doing either it popped for me.
Astoundingly enough, this has already been studied. And I'm almost embarrassed to say that I'm familiar with the result. I used to freecell a lot. And FYI, 11982 is the impossible Frecell game. But I recommend entering in games -1, -2, -3, etc too.
So here are some stats from some studies of freecell. Firstly, the depth of the aces, i.e. how many cards cover the aces, is not a good measure of difficulty. On average, 11.077 cards cover the aces (counting aces). Analyzing the dozens of thousands of deals, it takes an average of somewhere between 42.12 (from a solver that ran 1.5 million deals) and 46.33 (from a solver on 32000 deals, the original 32000) moves to solve. This is a hard measure, as this is based on the quality of the solver - and it is unknown whether these solvers were optimal.
An interesting player-based study showed that about 79% of deals are solved by a person on their first try. It also turns out that some people examine how many freecells (the four in the top left) are actually necessary to solve a game. The impossible 11982 can be solved with 5 freecells. Almost every game can be solved with 3. Over half can be solved with 2. And almost 100 can be solved without any freecells at all. Take that, freecell!
One of the big problems is that freecell games are not at all randomly assorted, and so pencil and paper solutions aren't around. But lots of people have (surprisingly) cared about these questions, and so these results are all upper bounds. In short, about 45 moves is the average minimum.
It is interesting to see this discussion here which I discovered after the solutions' length has been discussed in recent (as of 6-December-2012) threads in the fc-solve-discuss mailing list (which I administrate), as well as some configurations that improved the solution length performance of Freecell Solver, a solver for Freecell and other solitaire deals (which I maintain).
Like other people note here, Generalised Freecell (where the number of ranks increase beyond the 13th rank (King)) is NP-complete, but regular Ace-to-King-based Freecell is not (although 13 is still a significant value for NP-complexity to handle) .
One issue that we found hard to resolve is how to measure the number of moves, because there are some variations for the "automatic-moves-of-cards-to-foundations" prune (also see Danny A. Jones' message about it with some pseudocode). This prompted me to phrase a specification of sorts for commonly agreed upon representation of a solution.
Close to optimal solutions for the first 1,000,000 deals on freecellgamesolutions.com - but with a very user-unfriendly interface that requires enabling JavaScript, filling in Captchas and other sorts of nastiness.
I did not know that many people had already written about game no. 11982. I came across this game and was trying for two days, every time hitting the impossible position. Perhaps the reason is that four number sets are piled one on another in this set. They are Black 5, Red 9, Black 4 and Black 7.
I wonder if these programs include moves where you would take from the foundation pile to help complete a black red black red pattern. As far as I know this is a legal move in freecell, albeit a bit unorthodox.
There have been a few games that I have tried several times and given up on, only to go back to the following day and beat easily. BUT I have been working on 11982 off and on for maybe 10 years and still no luck.
I have been trying for two days to beat 11982. I have a run of 5400+ without a loss. In the end I Googled and found this site. Like so many others, I wish I had looked earlier:). I thought I would be in for a tough time with 11982 when I saw that all four aces were hidden either at the bottom of card stacks,or in the case of the ace of diamonds, one down from the bottom. It makes it nigh on impossible to start clearing the game of cards before they start blocking avenues of play.
I used to gleefully watch my own stats mount up until I found by accident that, when a game becomes obviously lost, you can just restart the PC without closing Freecell and, Hey Presto, the game is forgotten and your stats remain untouched. Now that the stats are less important I find each game is more fun for itself. Before I start I can set myself other tasks to achieve, such as making sure the aces line up in a particular order as I free them, or seeing how few cards other than the aces I need to remove before that final rush of cards to victory, (I have once managed only the 4 aces and a single 2). That can make a relatively simple game take on a more challenging aspect.
on the question of 11982 if you shuffle a pack of cards you are doing it in such a way that no person living or dead has ever done before or will ever do so in the future taking this in to account would it not be foolish to conclude that there are no more 11982s lurking out there
Welcome to cell11982, a brute force freecell solver, by default set up to test the impossible puzzle, 11982. Three files are at that link. cell11982.py is the python program. Python programs are compiled on-the-fly, which means the program is the source code; you can open it in any text editor and see exactly what the program is doing. Source Explanation is a more detailed explanation of what the program is, how it works, and what it means.
In your comment, you were approaching the kind of proof I was looking for by discussing a step that needs to be reached in order to win (like getting the Ace of clubs or spades out), then showing how achieving that is impossible (easier said than done), which could then be used to prove the game is impossible. But I have yet to see such a proof.
Has anyone considered creating other unbeatable free cell games by starting with the layout for 11982 and then switching any 2 random cards before starting the game? No one seems to have discussed this possibility. Hard to believe that all such switches of just 2 cards would all result in solveable games.
I thought maybe I was just on a losing streak or losing my mind (LOL). So I will keep reading on this site and see if there is something I can do. Does anyone have any great ideas or do I just let it go.
After wasting at least an hour on 11982, my online search for a solution lead me here. Thanks for letting me know 11982 is unsolvable. After bailing out of that game, I was dealt 16351 by my computer. This was a sweet follow up game, because I was able to play it down to two cards left; the King of Diamonds on top of the Queen of Diamonds.
@Reg There are plenty of unwinnable games. You can easily create one if you bury essential cards deeply. But Microsoft said they believed all of their games to be winnable, which makes #11982 interesting.
As far as I know, no authority in this matter claims that EVERY possible deal of 52 cards in Freecell is winnable. I feel sure that is because they all KNOW that not all games are winnable, and very far from it.
The instant proof that not all games are winnable is to select games # -1 and # -2. These are IMPOSSIBLE at a glance, and many other games could be dealt which are IMPOSSIBLE to solve within the rules.
03c5feb9e7