Problem 840. SET (the card game)

Created by Matthew Eicholtz

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://www.setgame.com/set/index.html\"><w:r><w:t>SET</w:t></w:r></w:hyperlink><w:r><w:t> is a card game in which players try to find valid 3-card sets from 12 cards on the table. What makes a valid set? Every card has four features, each with three possible values. In a valid set, each of the features, when looked at individually, are either the</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>same</w:t></w:r><w:r><w:t> on each card OR</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>different</w:t></w:r><w:r><w:t> on each card.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>In this problem, you are given a 12x4 matrix representing 12 cards (rows) with 4 features (columns) each. The</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>N</w:t></w:r><w:r><w:t>-th row corresponds to the</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>N</w:t></w:r><w:r><w:t>-th card. Each feature has a value of 0, 1, or 2. Create a function that returns an Mx3 matrix of all valid sets, where each row is a set and each column is the index to a card in the set. For every set, the cards (columns) should be arranged in ascending order. If there are no valid sets for a given input, return []. You may assume that all cards are unique.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[cards = [1 0 1 0\n 1 1 1 1\n 2 2 1 0\n 0 1 2 2\n 2 1 1 1\n 1 0 1 2\n 0 0 0 0\n 2 2 2 2\n 0 2 0 0\n 1 1 1 0\n 0 1 0 2\n 0 2 0 2];]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>returns</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[sets = [2 7 8\n 6 8 11]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>because there are two valid sets. Cards 2,7, and 8 make one set and cards 6,8, and 11 form another set. Notice that a card can be a part of more than one set.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

<a href="http://www.setgame.com/set/index.html">SET</a> is a card game in which players try to find valid 3-card sets from 12 cards on the table. What makes a valid set? Every card has four features, each with three possible values. In a valid set, each of the features, when looked at individually, are either the same on each card OR different on each card.In this problem, you are given a 12x4 matrix representing 12 cards (rows) with 4 features (columns) each. The N-th row corresponds to the N-th card. Each feature has a value of 0, 1, or 2. Create a function that returns an Mx3 matrix of all valid sets, where each row is a set and each column is the index to a card in the set. For every set, the cards (columns) should be arranged in ascending order. If there are no valid sets for a given input, return []. You may assume that all cards are unique.Example<pre class="language-matlab">cards = [1 0 1 0
 1 1 1 1
 2 2 1 0
 0 1 2 2
 2 1 1 1
 1 0 1 2
 0 0 0 0
 2 2 2 2
 0 2 0 0
 1 1 1 0
 0 1 0 2
 0 2 0 2];
</pre>returns<pre class="language-matlab">sets = [2 7 8
 6 8 11]
</pre>because there are two valid sets. Cards 2,7, and 8 make one set and cards 6,8, and 11 form another set. Notice that a card can be a part of more than one set.

Solve

Solution Stats

115 Solutions
66 Solvers

Last Solution submitted on Jul 26, 2020

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

Amro on 10 Aug 2012

A related question on Stack Overflow:

Asif Newaz on 15 Feb 2020

i dont understand it properly..how 6,8,11 is a valid set ?

Highphi on 26 Jul 2020 at 16:28

NOTE: That link has moved. It is now HERE: https://www.setgame.com/sites/default/files/instructions/SET%20INSTRUCTIONS%20-%20ENGLISH.pdf

Highphi on 26 Jul 2020 at 16:40

Also, I think you make a 'set' by combining 3 different cards so that, when combined, have 0 1 and 2 in each column or one of those options across entire column

for 2 7 8:
1 1 1 1
0 0 0 0
2 2 2 2
-- has 0, 1, 2 in each column

for 6 8 11,
1 0 1 2
2 2 2 2
0 1 0 2
-- has 0, 1, 2 in first three column and all 2s in last column

Solution Comments

Solution 126182

1 Comment

1 Comment

Khaled Hamed on 10 Aug 2012

Almost.....!

Solution 115065

1 Comment

1 Comment

Matthew Eicholtz on 19 Jul 2012

trying to do it without a for-loop

Solution 115047

1 Comment

1 Comment

Tim on 18 Jul 2012

Using parts of Solution 115046

Solution 115046

1 Comment

1 Comment

Matthew Eicholtz on 18 Jul 2012

Using parts of Solution 114934

Problem Recent Solvers66

Problem Tags

games matrix manipulation

Problem 840. SET (the card game)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers66

Suggested Problems

More from this Author44

Problem Tags

Problem 840. SET (the card game)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers66

Suggested Problems

More from this Author44

Problem Tags

Players