Timeline for In the card game Set, what's the probability of a Set existing in n cards?
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S May 25, 2016 at 19:52 | history | suggested | Tom Church | CC BY-SA 3.0 |
fix broken links to Knuth's webpage + program
|
May 25, 2016 at 19:42 | comment | added | Tom Church | The WEB program is now at this link: cs.stanford.edu/~knuth/programs/setset-all.w | |
May 25, 2016 at 19:42 | review | Suggested edits | |||
S May 25, 2016 at 19:52 | |||||
Nov 7, 2012 at 16:06 | comment | added | joriki | @Daniel: I think it means the number of equivalence classes under symmetry operations. I think it's all explained in the WEB program. | |
Nov 7, 2012 at 15:30 | comment | added | Daniel | Of course - sorry for not noticing the integers ;). So now I'm completely answered except for the closed form, which appears to be next to impossible to find. Also, what does the list of "cases" e.g. (2489 cases) etc. mean? | |
Sep 30, 2012 at 13:30 | comment | added | joriki | @Daniel: I suspect that Knuth put some thought into finding a closed form before he went to all that trouble to write and debug those programs, so if there is a closed form it's probably hard to find. I don't quite understand your question about fractions -- I quoted the output of the program verbatim; the results are counts of combinations and hence integers, so I don't see how fractions enter into it. In case you meant the numbers in the table; those are not output by the program; I generated them by dividing by $\binom{81}n$, and you can express that division in fractions if you prefer. | |
Sep 28, 2012 at 18:06 | comment | added | Daniel | I wonder if there is a closed function to describe these values given n=number of cards. Also, can the program output fractions? (I accepted this answer since it gives the values I was after.) | |
Sep 28, 2012 at 18:04 | vote | accept | Daniel | ||
Sep 27, 2012 at 0:14 | history | answered | joriki | CC BY-SA 3.0 |