Tool/Solver to find the sets of 3 cards in the board game Set (1, 2 or 3, red, purple or green, diamond, oval or wave, empty, stripped or full)
Set Solver - dCode
Tag(s) : Board Games
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Set Solver
Solve a Set game
SET game generator
Answers to Questions (FAQ)
What is the SET game? (Definition)
The SET game is a board game using 81 distinct cards which differ according to 4 visual characteristics:
— The number of drawings: 1, 2 or 3 symbols
— The color of the drawing: red, purple or green (sometimes turquoise blue)
— The shape of the drawing: diamond, oval, or wave (sometimes rectangle)
— Filling/Shading of the drawing: empty, striped/hatched or full
What is the goal of the SET game?
The object of the game is to find sets of 3 cards whose characteristics occur 1 or 3 times but never 2 times. That is to say, either the 3 cards have the identical characteristic, or the 3 cards have the distinct characteristic.
Example: .png)
.png)
.png)
is a valid set because the 3 cards have the same color green (3 times), the number of drawings is either 1, or 2, or 3 (1 time each), the shape is the same diamond (3 times), the filling is the same empty/open (3 times).
Example: .png)
.png)
.png)
is not a valid set, because the fill empty is present 2 times and the shape diamond is present 2 times. (The color and number are OK).
How to use the set solver?
Indicate the draw cards by clicking on them and launch the search.
All possible sets will be displayed if they exist.
A game is played with 12 cards, but there is not always a solution. From 21 (separate) cards a solution is mathematically obligatory.
The dCode solver is designed to help players, speed up games, or practice, please do not use it for cheating.
How many sets in a classic 12-card game?
The number of sets among 12 cards varies. There can be zero (0) to more than 10, depending on the combinations.
On average, a random grid contains between 3 and 6 sets.
The dCode solver allows you to find them all quickly.
It is possible for a 12-card grid to contain no valid sets. In this case, the official rules of the game suggest adding 3 additional cards (up to 15, 18, or 21) until a set is found.
The best possible draw results in 14 sets.
Source code
dCode retains ownership of the "Set Solver" source code. Any algorithm for the "Set Solver" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Set Solver" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Set Solver" or any other element are not public (except explicit open source licence like Creative Commons). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
Cite dCode
The content of the page "Set Solver" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source.
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: Set Solver on dCode.fr [online website], retrieved on 2025-05-01,
