- Tue Jul 12, 2016 12:00 pm
#27046
Setup and Rule Diagram Explanation
This is a Grouping Game: Defined-Moving, Balanced, Numerical Distribution.
On the surface, this game appears fairly easy: five pieces of mail addressed to three different housemates. However, there is a great deal of uncertainty because number of pieces of mail each housemate receives is not fixed.
With only five pieces of mail for the three housemates, and with each housemate receiving at least one piece of mail, there are only two possible numerical distributions in this game:
3 - 1 - 1: one housemate receives three pieces of mail, and each of the other housemates receives one piece of mail.
2 - 2 - 1: two housemates receives two pieces of mail each, and the other housemate receives one piece of mail.
The last rule ties into these two distributions by establishing that the housemate receiving F must be in the group of 3 in the 3-1-1 distribution, or in one of the groups of 2 in the 2-2-1 distribution.
The other two rules are fairly generic. The first rule establishes two Not Laws on G, and leaves G with only three options for mail: F, P, and/or S. This rule also establishes that L and M will always be addressed to J or R. This has important consequences when paired with the second rule.
The second rule is conditional, and can be diagrammed as follows:
The rules and relationships above can be compiled to form our main diagram:
Another important deduction in this game is that either L or P (or both) must be addressed to Jana. This is a function of the contrapositive of the second rule: if P is not addressed to Jana, then L cannot be addressed to Rini. But, since L can only be addressed to Jana or Rini (and not Georgette, thanks to the first rule), it logically follows that if P is not addressed to Jana, then L must be addressed to Jana (PJ LJ). And inversely, if L is not addressed to Jana, then P must be (LJ PJ).
With the information in the setup, we are ready for the questions.
This is a Grouping Game: Defined-Moving, Balanced, Numerical Distribution.
On the surface, this game appears fairly easy: five pieces of mail addressed to three different housemates. However, there is a great deal of uncertainty because number of pieces of mail each housemate receives is not fixed.
With only five pieces of mail for the three housemates, and with each housemate receiving at least one piece of mail, there are only two possible numerical distributions in this game:
3 - 1 - 1: one housemate receives three pieces of mail, and each of the other housemates receives one piece of mail.
2 - 2 - 1: two housemates receives two pieces of mail each, and the other housemate receives one piece of mail.
The last rule ties into these two distributions by establishing that the housemate receiving F must be in the group of 3 in the 3-1-1 distribution, or in one of the groups of 2 in the 2-2-1 distribution.
The other two rules are fairly generic. The first rule establishes two Not Laws on G, and leaves G with only three options for mail: F, P, and/or S. This rule also establishes that L and M will always be addressed to J or R. This has important consequences when paired with the second rule.
The second rule is conditional, and can be diagrammed as follows:
- LR PJ
- LR PJ F/SG
The rules and relationships above can be compiled to form our main diagram:
Another important deduction in this game is that either L or P (or both) must be addressed to Jana. This is a function of the contrapositive of the second rule: if P is not addressed to Jana, then L cannot be addressed to Rini. But, since L can only be addressed to Jana or Rini (and not Georgette, thanks to the first rule), it logically follows that if P is not addressed to Jana, then L must be addressed to Jana (PJ LJ). And inversely, if L is not addressed to Jana, then P must be (LJ PJ).
With the information in the setup, we are ready for the questions.
You do not have the required permissions to view the files attached to this post.