document.write( "Question 875472: Hello. I have a question regarding the number of combinations in the game Qwirkle. In Qwirkle, each chip has a shape and a color. There are six shapes and six colors, resulting in a total of 36 types of chips. There are three replications of each type. Thus, there are 108 chips in total. Six chips are initially drawn at random. So I am interested in finding the unique combinations of chips that can initially be drawn. Knowing this number will enable me to compute the probability of various outcomes. Here is the approach I took:\r
\n" ); document.write( "\n" ); document.write( "1) assume chips of the same type are indistinguishable (e.g. a blue square and another blue square are the same)\r
\n" ); document.write( "\n" ); document.write( "2) enumerate integer partitions with the restriction that the integers must sum to six and a single integer cannot exceed three (because there are only three of each type). \r
\n" ); document.write( "\n" ); document.write( "3) count the number of integers in each partition, K, and compute 36 choose K\r
\n" ); document.write( "\n" ); document.write( "4) sum the combinations from step 3\r
\n" ); document.write( "\n" ); document.write( "Partition 1: 3,3\r
\n" ); document.write( "\n" ); document.write( "Partition 2: 3,1,1,1\r
\n" ); document.write( "\n" ); document.write( "Partition 3: 2,1,1,1,1\r
\n" ); document.write( "\n" ); document.write( "Partition 4: 1,1,1,1,1,1\r
\n" ); document.write( "\n" ); document.write( "Partition 5: 2,2,2\r
\n" ); document.write( "\n" ); document.write( "Partition 6: 2,2,1,1\r
\n" ); document.write( "\n" ); document.write( "Partition 7: 3,2,1\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Answer: 36 choose 2 + 36 choose 4 + 36 choose 5 + 36 choose 6 + 36 choose 3 + 36 choose 4 + 36 choose 3\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Is my reasoning correct?\r
\n" ); document.write( "\n" ); document.write( "Thank you!
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #528283 by Edwin McCravy(20055)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "I think it's this way for the 7 partitions:\r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 1: 3,3 \r\n" );
document.write( "\r\n" );
document.write( "Choose the types for the 2 triples in 36C2 ways.\r\n" );
document.write( "\r\n" );
document.write( "That's 36C2 = 630 ways.\r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 2: 3,1,1,1 \r\n" );
document.write( "\r\n" );
document.write( "Choose the type for the triple in 36C1 ways\r\n" );
document.write( "Choose the types for the 3 singles in 35C3 ways\r\n" );
document.write( "\r\n" );
document.write( "That's 36C1×35C3  = 36×6545 = 235620 ways\r\n" );
document.write( "\r\n" );
document.write( "[Notice here that if you choose the 3 singles first in 36C3 ways,\r\n" );
document.write( "then the triple in 33C1 ways,\r\n" );
document.write( "\r\n" );
document.write( "that would be 36C3×33C1 = 7140×33 = 235620 ways, which shows that\r\n" );
document.write( "it doesn't matter.] \r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 3: 2,1,1,1,1 \r\n" );
document.write( "\r\n" );
document.write( "Choose the type for the double in 36C1 ways\r\n" );
document.write( "Choose the types for the 4 singles in 35C4 ways\r\n" );
document.write( "\r\n" );
document.write( "That's 36C1×35C4 = 36×52360 = 1884960 ways\r\n" );
document.write( "\r\n" );
document.write( "[Notice here that if you choose the 4 singles first in 36C4 ways,\r\n" );
document.write( "then choose the triple in 32C1 ways,\r\n" );
document.write( "\r\n" );
document.write( "that would be 36C4×32C1 = 58905×32 = 1884960 ways, which shows that\r\n" );
document.write( "it doesn't matter] \r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 4: 1,1,1,1,1,1 \r\n" );
document.write( "\r\n" );
document.write( "Choose the types for the 6 singles in 36C6 ways\r\n" );
document.write( "\r\n" );
document.write( "That's 36C6 = 1947792 ways\r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 5: 2,2,2 \r\n" );
document.write( "\r\n" );
document.write( "Choose the types for the 3 doubles in 36C3 ways\r\n" );
document.write( "\r\n" );
document.write( "That's 36C3 = 7140 ways.\r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 6: 2,2,1,1 \r\n" );
document.write( "\r\n" );
document.write( "Choose the types for the 2 doubles in 36C2 ways\r\n" );
document.write( "Choose the types for the 2 singles in 34C2 ways\r\n" );
document.write( "\r\n" );
document.write( "That's 36C2×34C2 = 630×561 = 353430 ways.\r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------\r\n" );
document.write( "\r\n" );
document.write( "Partition 7: 3,2,1\r\n" );
document.write( "\r\n" );
document.write( "Choose the type for the triple in 36C1 ways\r\n" );
document.write( "Choose the type for the double in 35C1 ways\r\n" );
document.write( "Choose the type for the single in 34C1 ways\r\n" );
document.write( "\r\n" );
document.write( "That's 36C1×35C1×34C1 = 36×35×33 = 42840 ways.\r\n" );
document.write( "\r\n" );
document.write( "------------------------------------------------ \r\n" );
document.write( "\r\n" );
document.write( "630 + 235620 + 1884960 + 1947792 + 7140 + 353430 + 42840 = 4472412 total.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );