Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Set (card game)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Pattern-finding real-time card game}} {{Distinguish|set (cards)}} {{italic title}} {{infobox card game | Rules = | title = Set | type = [[Real-time card game|Real-time]] | image_link = Set-game-cards.png | caption = Three cards from a ''Set'' deck. These cards each have a unique number, symbol, shading, and color, and are thus a "set". | players = 1+<ref name="Instructions">{{Cite web |last=Cannei, LLC |date=1991 |title=SET Instructions |url=https://www.setgame.com/sites/default/files/instructions/SET%20INSTRUCTIONS%20-%20ENGLISH.pdf |access-date=17 January 2023}}</ref> | ages = 6 years +<ref name="Instructions"/> | num_cards = 81 | complexity = | strategy = | random_chance = | playing_time = | skills = Visualization, logical reasoning, ability to focus }} '''''Set''''' (stylized as '''SET''' or '''SET!''') is a [[real-time card game]] designed by Marsha Falco in 1974 and published by [[Set Enterprises]] in 1991. The [[Deck of cards|deck]] consists of 81 unique cards that vary in four features across three possibilities for each kind of feature: number of shapes (one, two, or three), shape (diamond, squiggle, oval), shading (solid, striped, or open), and color (red, green, or purple).<ref>{{Cite web|date=2015-08-11|title=How to Play the Daily SET Puzzle|url=http://www.setgame.com/set/puzzle_rules|access-date=2022-02-07|website=America's Favorite Card Games®|language=en|archive-date=2022-01-13|archive-url=https://web.archive.org/web/20220113104625/https://www.setgame.com/set/puzzle_rules|url-status=live}}</ref> Each possible combination of features (e.g. a card with three striped green diamonds) appears as a card precisely ''once'' in the deck. == Gameplay == In the game, certain combinations of three cards are said to make up a "set". For each one of the four categories of features—color, number, shape, and shading—the three cards must display that feature as either a) all the same, or b) all different. Put another way: For each feature the three cards must ''avoid'' having two cards showing one version of the feature and the remaining card showing a different version. For example, 3 solid red diamonds, 2 solid green squiggles, and 1 solid purple oval form a set, because the shadings of the three cards are all the same, while the numbers, the colors, and the shapes among the three cards are all different. For any set, the number of features that are constant (the same on all three cards) and the number of features that differ (different on all three cards) may break down as: all 4 features differing; or 1 feature being constant and 3 differing; or 2 constant and 2 differing; or 3 constant and 1 differing. (All 4 features being constant would imply that the three cards in the set are identical, which is impossible since no cards in the Set deck are identical.) [[File:Set Championship.jpg|thumb|The final round of the First Annual National ''Set'' Championship.]] == History == The game evolved out of a coding system that the designer used in her job as a geneticist. The shapes are based on those in [[ISO 5807]].<ref>{{Cite web |date=2006-10-21 |title=Set - The history of |url=https://www.setgame.com/set/history.htm |access-date=2022-02-07 |website= |archive-url=https://web.archive.org/web/20061021101744/https://www.setgame.com/set/history.htm |archive-date=21 October 2006 |url-status=dead}}</ref> ''Set'' won [[Mensa International|American Mensa's]] ''[[List of Mensa Select recipients|Mensa Select]]'' award in 1991 and placed 9th in the 1995 ''[[Deutscher Spiele Preis]]''. The First Annual National ''Set'' Championship was hosted on January 8, 2025 at the Joint Mathematics Meeting in Seattle, Washington. Approximately 150 players competed, with Taiki Aiba winning first prize: a customized boxing style belt.<ref>{{Cite web |last=Society |first=American Mathematical |title=Joint Mathematics Meetings 2025 Social Events |url=https://jointmathematicsmeetings.org/meetings/national/jmm2025/2314_socialev.html |access-date=2025-04-22 |website=Joint Mathematics Meetings |language=en}}</ref> == Games == [[file: Deskohraní 2012 - 6831.JPG|thumb|alt=A group of people at a table playing set |Playing ''Set'']] Several games can be played with these cards, all involving the concept of a ''set''. A set consists of three cards satisfying ''all'' of these conditions: * They all have the same number or have three different numbers. * They all have the same shape or have three different shapes. * They all have the same shading or have three different shadings. * They all have the same color or have three different colors. The rules of ''Set'' are summarized by: If you can sort a group of three cards into "two of ____ and one of ____", then it is not a set. For example, these three cards form a set: * One red striped diamond * Two red solid diamonds * Three red open diamonds Given any two cards from the deck, there is [[one and only one]] other card that forms a set with them. In the standard ''Set'' game, the dealer lays out cards on the table until either twelve are laid down or someone sees a set and calls "Set!". The player who called "Set" takes the cards in the set, and the dealer continues to deal out cards until twelve are on the table. A player who sees a set among the twelve cards calls "Set" and takes the three cards, and the dealer lays three more cards on the table. (To call out "set" and not pick one up quickly enough results in a penalty.) There may be no set among the twelve cards; in this case, the dealer deals out three more cards to make fifteen dealt cards, or eighteen or more, as necessary. This process of dealing by threes and finding sets continues until the deck is exhausted and there are no more sets on the table. At this point, whoever has collected the most sets wins. Variants were included with the ''Set'' game that involve different mechanics to find sets, as well as different player interaction. Additional variants continue to be created by avid players of the game.<ref>{{Cite web|title=Set Variants|url=http://magliery.com/Set/SetVariants.html|access-date=2022-02-07|website=magliery.com|archive-date=2012-05-30|archive-url=https://web.archive.org/web/20120530223226/http://magliery.com/Set/SetVariants.html|url-status=live}}</ref><ref>{{Cite web|title=Get Set - A Set Variant|url=http://www.thegamesjournal.com/rules/GetSet.shtml|access-date=2022-02-07|website=www.thegamesjournal.com|archive-date=2013-04-13|archive-url=https://web.archive.org/web/20130413050239/http://www.thegamesjournal.com/rules/GetSet.shtml|url-status=usurped}}</ref> == Basic combinatorics of ''Set'' == {{Set_isomorphic_cards.svg}} * Given any two cards, there is exactly one card that forms a set with those two cards. Therefore, the probability of producing a Set from 3 randomly drawn cards from a complete deck is 1/79. * A [[cap set]] is a mathematical structure describing a Set layout in which no set may be taken. The largest group of cards that can be put together without creating a set is 20, proven in 1971 (cap sets were studied before the game).<ref>{{Citation |last=Hill |first=R. |title=On Pellegrino's 20-Caps in S4, 3 |date=1983-01-01 |url=https://www.sciencedirect.com/science/article/pii/S030402080873322X |work=North-Holland Mathematics Studies |volume=78 |pages=433–447 |editor-last=Barlotti |editor-first=A. |access-date=2023-12-16 |series=Combinatorics '81 in honour of Beniamino Segre |publisher=North-Holland |doi=10.1016/S0304-0208(08)73322-X |isbn=978-0-444-86546-5 |editor2-last=Ceccherini |editor2-first=P. V. |editor3-last=Tallini |editor3-first=G.}}</ref><ref>{{citation|last=Edel|first=Yves|doi=10.1023/A:1027365901231|issue=1|journal=Designs, Codes and Cryptography|mr=2031694|pages=5–14|title=Extensions of generalized product caps|volume=31|year=2004|s2cid=10138398}}.</ref><ref>{{Cite web|url=http://www.math.rutgers.edu/~maclagan/papers/set.pdf|title=The Card Game Set|author=Benjamin Lent Davis and [[Diane Maclagan]]|url-status=dead|archive-url=https://web.archive.org/web/20130605073741/http://www.math.rutgers.edu/~maclagan/papers/set.pdf|archive-date=June 5, 2013}}</ref> Such a group is called a maximal cap set {{OEIS|A090245}}. [[Donald Knuth]] found in 2001 that there are 682344 such cap sets of size 20 for the 81-card version of Set; under affine transformations on 4-dimensional finite space, they all reduce to essentially one cap set. * There are <math>\textstyle\frac{{81 \choose 2}}{3} = \frac{81 \times 80}{2 \times 3} = 1080</math> unique sets. * The probability that a set will have <math>d</math> features different and <math>4 - d</math> features the same is <math>\textstyle\frac{{4 \choose d}2^d}{80}</math>. (Note: The case where ''d'' = 0 is impossible, since no two cards are identical.) Thus, 10% of possible sets differ in one feature, 30% in two features, 40% in three features, and 20% in all four features. <!-- * When a complete deck of 81 Set cards is partitioned into two piles of size n and (81-n), the sum of the number of Sets that can be made using only cards in the first pile plus the number of Sets that can be made using only cards in the second pile has a maximum given by <math>\frac{{81 \choose 2}}{3} - \frac{n(81-n)}{2}</math>. --> * The number of different 12-card deals is <math>\textstyle{81 \choose 12} = \frac{81!}{12! 69!} = 70\,724\,320\,184\,700 \approx 7.07 \times 10^{13}</math>. * The odds against there being no ''Set'' in 12 cards when playing a game of Set start off at 30:1 for the first round. Then they quickly fall, and after about the 4th round they are 14:1 and for the next 20 rounds, they slowly fall towards 13:1. So for most of the rounds played, the odds are between 14:1 and 13:1.<ref name="Revisited">{{Cite web|url=http://henrikwarne.com/2011/09/30/set-probabilities-revisited/|title=SET Probabilities Revisited|date=30 September 2011|access-date=4 October 2011|archive-date=10 December 2011|archive-url=https://web.archive.org/web/20111210084923/http://henrikwarne.com/2011/09/30/set-probabilities-revisited/|url-status=live}}</ref> * The odds against there being no Set in 15 cards ''when playing a game'' are 88:1.<ref name="Revisited" /> (This is different from the odds against there being no Set in ''any'' 15 cards (which is 2700:1) since during play, 15 cards are only shown when a group of 12 cards has no Set.) * Around 30% of all games always have a Set among the 12 cards, and thus never need to go to 15 cards.<ref>{{Cite web|date=2011-09-30|title=SET® Probabilities Revisited|url=https://henrikwarne.com/2011/09/30/set-probabilities-revisited/|access-date=2022-02-07|website=Henrik Warne's blog|language=en|archive-date=2022-02-07|archive-url=https://web.archive.org/web/20220207053109/https://henrikwarne.com/2011/09/30/set-probabilities-revisited/|url-status=live}}</ref> * The maximum number of Sets for 12 cards is 14.<ref>{{Cite web|date=2025-01-25|title=The Maximum Number of Sets for 12 Cards is 14|url=https://arxiv.org/abs/2501.12565}}</ref> * The average number of available Sets among 12 cards is <math>\textstyle{12 \choose 3} \cdot \frac{1}{79} \approx 2.78</math> and among 15 cards <math>\textstyle{15 \choose 3} \cdot \frac{1}{79} \approx 5.76</math>. However, in play the numbers are smaller. * If there were 26 sets picked from the deck, the last three cards would necessarily form another 27th set. == Complexity == Using a natural generalization of ''Set'', where the number of properties and values vary, it was shown that determining whether a set exists from a collection of dealt cards is [[NP-completeness|NP-complete]].<ref>{{cite tech report |last1=Chaudhuri |first1=Kamalika |last2=Godfrey |first2=Brighten |last3=Ratajczak |first3=David |last4=Wee |first4=Hoeteck |title=On the Complexity of the Game of Set |date=2003 |url=http://pbg.cs.illinois.edu/papers/set.pdf |archive-url=https://web.archive.org/web/20220109234141/http://pbg.cs.illinois.edu/papers/set.pdf |archive-date=2022-01-09 |url-status=live}}</ref> ==Reviews== *''[[Games (magazine)|Games]]'' #107<ref>{{cite web | url=https://archive.org/details/Games-Magazine-February-1992-images/page/n49/mode/2up | title=Games Magazine [February 1992] | date=February 1992 }}</ref> *1992 Games 100 in ''[[Games (magazine)|Games]]'' #112<ref>{{cite web | url=https://archive.org/details/Games-Magazine-December-1992-images/page/54/mode/2up | title=Games Magazine [December 1992] | date=December 1992 }}</ref> *''Family Games: The 100 Best''<ref>{{cite book | url=https://archive.org/details/familygames100be0000unse/page/296/mode/2up | isbn=978-1-934547-21-2 | title=Family games : The 100 best | date=2010 | last1=Lowder | first1=James | publisher=Green Ronin }}</ref> ==See also== * [[Projective Set (game)|Projective Set]] == References == <references /> == External links == *[https://www.playmonster.com/brands/set/ Set Enterprises] website * [https://www.youtube.com/watch?v=xIAjZrg6MgA ''The card game SET and some results in extremal combinatorics''] - lecture by [[Lisa Sauermann]] (video, 1:41 h) *[https://web.archive.org/web/20150906034743/http://homepages.warwick.ac.uk/staff/D.Maclagan/papers/set.pdf A (2002?) mathematic exploration of the game ''Set'' ]. Including 'How many cards may be laid without creating a set', as well as investigations of different types of set games (some in the [[Fano plane]]). *[https://web.archive.org/web/20160801130217/http://digitalcommons.ric.edu/cgi/viewcontent.cgi?article=1094&context=honors_projects The Mathematics of the Card Game Set - Paola Y. Reyes - 2014 - Rhode Island College Honors Projects] *{{Bgg title|1198|''Set''}} *There is a graphic computer solitaire version of Set written in [[tcl/Tk]]. The script can be found in a "tclapps" bundle at [[ActiveState]] [https://web.archive.org/web/20110408001443/http://tcl.activestate.com:80/pub/tcl/nightly-cvs Ftp://tcl.activestate.com/pub/tcl/nightly-cvs/]. * [https://www.maa.org/sites/default/files/pdf/pubs/SetsPlanetsAndComets.pdf Sets, Planets, and Comets.] An alternate, extended version of Set * [https://www.setgame.com/set/puzzle Set Daily Puzzle] * [https://tidy.games/triq Triq] A web-based Daily puzzle game with shareable scores, inspired by Set * [https://www.set-finder.com/ SET Finder] * [https://setwithfriends.com/ Set with Friends] [[category:card games introduced in 1991]] [[category:dedicated deck card games]] [[category:Mensa Select winners]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:81 \choose 2
(
edit
)
Template:Bgg title
(
edit
)
Template:Citation
(
edit
)
Template:Cite book
(
edit
)
Template:Cite tech report
(
edit
)
Template:Cite web
(
edit
)
Template:Distinguish
(
edit
)
Template:Infobox card game
(
edit
)
Template:Italic title
(
edit
)
Template:OEIS
(
edit
)
Template:Set isomorphic cards.svg
(
edit
)
Template:Short description
(
edit
)