HOME

TheInfoList



OR:

FreeCell is a solitaire
card game A card game is any game that uses playing cards as the primary device with which the game is played, whether the cards are of a traditional design or specifically created for the game (proprietary). Countless card games exist, including famil ...
played using the
standard 52-card deck The standard 52-card deck of French-suited playing cards is the most common pack of playing cards used today. The main feature of most playing card decks that empower their use in diverse games and other activities is their double-sided design, w ...
. It is fundamentally different from most solitaire games in that very few deals are unsolvable, and all cards are dealt face-up from the beginning of the game. Microsoft has included a FreeCell computer game with every release of the Windows
operating system An operating system (OS) is system software that manages computer hardware and software resources, and provides common daemon (computing), services for computer programs. Time-sharing operating systems scheduler (computing), schedule tasks for ...
since 1995, which has greatly contributed to the game's popularity.


Rules

One standard 52-card deck is used. There are four open cells and four open foundations. Cards are dealt face-up into eight cascades, four of which comprise seven cards each and four of which comprise six cards each. The top card of each cascade begins a
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
. Tableaus must be built down by alternating colors. Foundations are built up by suit. The Foundations begin with Ace and are built up to King. Any cell card or top card of any cascade may be moved to build on a tableau, or moved to an empty cell, an empty cascade, or its foundation. The game is won after all cards are moved to their foundation piles.


Supermoves

Unlike in many solitaire card games, the rules of Freecell only allow cards to be moved one at a time. Complete or partial tableaus may be moved to build on existing tableaus, or moved to empty cascades, only by a sequence of moves which recursively place and remove cards through intermediate locations. For example, with one empty cell, the top card of one tableau can be moved to a free cell. The second card from the top of that tableau can now be moved onto another tableau. Then the original top card can be moved from the cell on top of it. Such a sequence of moves is called a "supermove". Computer implementations often show this motion, but players using physical decks typically just move the tableau at once. The maximum number C of cards in a tableau that can be moved to another tableau equals the number of empty cells plus one, with that number doubling for each empty cascade: C = 2^M\times (N+1), where M is the number of empty cascades and N is the number of empty cells. The maximum number that can be moved to an empty cascade is C/2.


Numbered hands

Although software implementations vary, most versions label the hands with a number derived from the seed value used by the
random number generator Random number generation is a process by which, often by means of a random number generator (RNG), a sequence of numbers or symbols is generated that cannot be reasonably predicted better than by random chance. This means that the particular ou ...
to shuffle the cards. Microsoft FreeCell is so definitive for FreeCell players that many other software implementations include compatibility with its random number generator in order to replicate its numbered hands.


History and variants

One of the oldest ancestors of FreeCell is Eight Off. In the June 1968 edition of ''
Scientific American ''Scientific American'', informally abbreviated ''SciAm'' or sometimes ''SA'', is an American popular science magazine. Many scientists, including Albert Einstein and Nikola Tesla, have contributed articles to it, with more than 150 Nobel Pri ...
'',
Martin Gardner Martin Gardner (October 21, 1914May 22, 2010) was an American popular mathematics and popular science writer with interests also encompassing magic, scientific skepticism, micromagic, philosophy, religion, and literatureespecially the writin ...
described in his "Mathematical Games" column a game by C. L. Baker which is similar to FreeCell, except that cards on the tableau are built by suit rather than by alternate colors. Gardner wrote, "The game was taught to Baker by his father, who in turn learned it from an Englishman during the 1920s." This variant is now called Baker's Game. FreeCell's origins may date back even further to 1945 and to a Scandinavian game called Napoleon in St. Helena (not the solitaire game Napoleon at St Helena, also known as Forty Thieves). Paul Alfille changed Baker's Game by making cards build according to alternate colors, thus creating FreeCell. He implemented the first computerised version as a medical student at the University of Illinois, in the TUTOR programming language for the
PLATO Plato ( ; Greek language, Greek: , ; born  BC, died 348/347 BC) was an ancient Greek philosopher of the Classical Greece, Classical period who is considered a foundational thinker in Western philosophy and an innovator of the writte ...
educational computer system in 1978. Alfille was able to display easily recognizable graphical images of playing cards on the monochrome display on the PLATO systems. This original FreeCell environment allowed games with 4–10 columns and 1–10 cells in addition to the standard game. For each variant, the program stored a ranked list of the players with the longest winning streaks. There was also a tournament system that allowed people to compete to win difficult hand-picked deals. Paul Alfille described this early FreeCell environment in more detail in an interview from 2000. In 2012, researchers used
evolutionary computation Evolutionary computation from computer science is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms ...
methods to create winning FreeCell players. A variant where card sequence movement is not limited by available cells is known as Relaxed FreeCell. Other solitaire games related to or inspired by FreeCell include Seahaven Towers,
Penguin Penguins are a group of aquatic flightless birds from the family Spheniscidae () of the order Sphenisciformes (). They live almost exclusively in the Southern Hemisphere. Only one species, the Galápagos penguin, is equatorial, with a sm ...
, Stalactites, ForeCell, Antares (a cross with
Scorpion Scorpions are predatory arachnids of the Order (biology), order Scorpiones. They have eight legs and are easily recognized by a pair of Chela (organ), grasping pincers and a narrow, segmented tail, often carried in a characteristic forward cur ...
).


Unsolvable hands

In 2018, Theodore Pringle and Shlomi Fish found that, of 8.6 billion FreeCell Pro deals, 102075 deals were impossible to solve, or approximately one impossible deal out of 84,000 random deals. It is estimated that around 99.999% of possible deals are solvable. Deal number 11982 from the Windows version of FreeCell is an example of an unsolvable FreeCell deal, the only deal among the original "Microsoft 32,000" which is unsolvable.


Solver complexity

The FreeCell game has a constant number of cards. This implies that in constant time, a person or computer could list all of the possible moves from a given start configuration and discover a winning set of moves or, assuming the game cannot be solved, the lack thereof. To perform an interesting complexity analysis, one must construct a generalized version of the FreeCell game with cards. This generalized version of the game is
NP-complete In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''. Somewhat more precisely, a problem is NP-complete when: # It is a decision problem, meaning that for any ...
; it is unlikely that any algorithm more efficient than a
brute-force search In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of Iteration#Computing, systematically checking all possible candida ...
exists which can find solutions for arbitrary generalized FreeCell configurations. There are 52! (i.e., 52
factorial In mathematics, the factorial of a non-negative denoted is the Product (mathematics), product of all positive integers less than or equal The factorial also equals the product of n with the next smaller factorial: \begin n! &= n \times ...
), or approximately 8, distinct deals. However, some games are effectively identical to others because suits assigned to cards are arbitrary or columns can be swapped. After taking these factors into account, there are approximately 1.75 distinct games.


See also

* Eight Off * Baker's Game * Klondike *
Penguin Penguins are a group of aquatic flightless birds from the family Spheniscidae () of the order Sphenisciformes (). They live almost exclusively in the Southern Hemisphere. Only one species, the Galápagos penguin, is equatorial, with a sm ...
* List of solitaires *
Glossary of solitaire Games of patience, or (card) solitaires as they are usually called in North America, have their own 'language' of specialised terms such as "building down", "packing", "foundations", "talon" and "tableau". Once learnt they are helpful in de ...


References


Additional sources

* * {{DEFAULTSORT:Freecell American card games French deck card games Patience video games PLATO (computer system) games Single-deck patience card games NP-complete problems