Algorithm to Create All "Spot it!" Cards

Asked Sep 21 '13 at 13:18

Active Sep 21 '13 at 13:47

Viewed 266 times

"Spot it!" is a fun card game, played with 55 cards, each having eight symbols. There are more than 50 symbols in all. There is always one, and only one, matching symbol between any two cards, and this is the feature on which all the games playable with these cards are based. Some mathematical aspects of the game are discussed here before.

enter image description here

Here's my question: How are these cards designed?! Put in a more mathematical way, is there an algorithm (not a brute-froce on!) to find all subsets of size $k$ of a set of size $n$, so that each two subsets have exactly one element in common?

Thanks.

Upadte: It seems that my question has been answered here.

edited May 23 '17 at 12:39

Community

asked Sep 21 '13 at 13:18

Behzad

2,317

1

possible duplicate of What is the math behind the game Spot It?; although the question is not identical, I think the given answers address the current question as well. See also this stackoverflow question – Marc van Leeuwen Sep 21 '13 at 13:28
Well, I looked at the other post on Stackexchange and it doesn't address my problem. BUT, you're right! That post on Stackoverflow is likely to be what I wanted. – Behzad Sep 21 '13 at 13:39
I've converted into a cards generator – Amit Kumar Gupta Jun 14 '18 at 09:48

Algorithm to Create All "Spot it!" Cards

0 Answers0

Linked