Simple Simon (solitaire)

Simple Simon is a patience or solitaire card game played with a regular 52 cards deck (4 suits of 13 cards each without Jokers). It is a close relative of the well-known Spider Solitaire. It became somewhat popular being featured in some computerized collections of Solitaire card games, but its origins possibly predate its implementation as a computerized game.

Simple Simon
A Patience game
FamilySpider
DeckSingle 52-card
See also Glossary of solitaire
Initial Simple Simon layout on PySol Fan Club Edition.

Rules

At the beginning of the play the cards are dealt all facing the player, starting from 3 columns of 8 cards each, and then 7 columns with 7, 6, and so forth cards until 1.

A card can be placed on any card on the top of a column whose rank is greater than it by one (with no cards that can be placed above an Ace). A sequence of cards, decrementing in rank and of the same suit, can be moved as one. An empty column can be filled by any card. A sequence of cards from the king down to the Ace - all of the same suit - can be moved to the foundations. The object of the game is to place all four suits in the foundations.

Strategy

A mixed-suit sequence of cards can be moved to a different location, given enough empty columns or parent cards to place intermediate components and sub-sequences of cards on. This is similar to FreeCell only with the individual components of the sequence being the same-suit sub-sequences rather than individual cards as in FreeCell. Note that some implementations of Simple Simon, require the player to do all the moving of the individual components by himself.

Statistics and analysis

In September 2001, Shlomi Fish adapted Freecell Solver, an automated solver for various solitaire card games, to solve Simple Simon.[1] The statistics presented by the solver when run over a range of 4000 random games showed that about 85% of the games were solvable.[2] Another programmer added another type of move which reportedly increased the percentage of games that were solvable by the solver to well over 90%.[3]

In 2009 a more up-to-date version of Freecell Solver produced the result that the solver was able to solve 4,533 (or 90%) of the deals, and generally reached a conclusion within 100 moves.[4] The comment has been made that this is "what makes the game a joy: either it's impossible to solve and you see it in the first moves or it's solvable and you only have to find the best route."[5]

gollark: Three Pi Zeroes?
gollark: Ah, I see.
gollark: Let me check the ArchLinuxARM page.
gollark: There are a few, but unfortunately software support is worse.
gollark: There are cheaper or more powerful SBCs.

References
  1. Fish, Shlomi (2001-09-25). "Freecell Solver Support for Simple Simon". Retrieved 2009-05-17.
  2. Fish, Shlomi (2001-09-28). "Updated Simple Simon Statistics". Retrieved 2009-05-17.
  3. Mann, Michael (2002-10-31). "Re: more on simple solving algorithms". Retrieved 2009-06-21.
  4. Fish, Shlomi (2009-07-10). "Updated Simple Simon Statistics (With the "Sequence to False Parent"". Retrieved 2009-07-18.
  5. https://groups.yahoo.com/group/fc-solve-discuss/message/119
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.