- Tue Oct 30, 2012 11:00 pm
#26040
Setup and Rule Diagram Explanation
This is a Grouping: Undefined, Numerical Distribution game.
The game scenario establishes that within three development zones (Z1, Z2, and Z3), a maximum of three subzones can be designated for each of three uses (H, I, R):
This is a somewhat unusual Grouping game, and is clearly the most difficult game on the test. Its difficulty is due to several factors:
The first rule establishes an R Not Law for Z1:
The second rule prohibits placing more than two H subzones in any given zone:
This is a Grouping: Undefined, Numerical Distribution game.
The game scenario establishes that within three development zones (Z1, Z2, and Z3), a maximum of three subzones can be designated for each of three uses (H, I, R):
This is a somewhat unusual Grouping game, and is clearly the most difficult game on the test. Its difficulty is due to several factors:
- 1. Min/max number of subzones overall. Although subzones can be designated for each use, neither the scenario nor the subsequent rules specify exactly how many subzones must be designated for each use. The word “can” in the second sentence of the scenario is crucial, leaving open the possibility that no subzones are being designated for any use. The rules do nothing to dispel that notion, as each rule represents a prohibition about what cannot be true, rather than an affirmation of what must be true. All we know is that the maximum possible number of subzones designated for each use is 3. The total number of subzones can be anywhere from 0 to 9.
2. Min/max number of subzones per zone. Some students misread the scenario to imply that no more than three subzones of each type were possible within each zone. This is incorrect. The scenario states that no more than three subzones can be designated for each use (H, I, R), not for each zone (Z1, Z2, Z3). In fact, the minimum number of subzones per zone is 0. As a result, there are a lot of possible Numerical Distributions of subzones, as the rules are not restrictive enough to establish a minimum number of subzones per zone. If something seems too laborious, it probably is: a detailed analysis of each distribution is neither required nor encouraged.
The first rule establishes an R Not Law for Z1:
The second rule prohibits placing more than two H subzones in any given zone:
- max. 2H/zone
- H max. 1R
- H ≥ 2 R
- I H
I 3R
- I max. 2R
- Since no zone contains more than 2H’s, no zone contains both an H and an I, and no zone with an H contains more than 1R, we can infer that if any zone contains H, that zone can contain a maximum of 3 subzones (H, H, R):
- H max. 3 (H, H, R)
- If a zone (other than Z1) contains an R subzone, then it can contain at most two R’s in order to allow as many I subzones as possible to be designated within it. Clearly, that zone will contain no H subzones, because those would limit the total number of subzones to 3 (see discussion above). Thus, if any zone contains R, that zone can contain a maximum of 5 subzones:
- R max. 5 (R, R, I, I, I)
- The same holds true if a zone contains an I subzone. Since I and H cannot be designated within the same zone, the maximum number of subzones allowed in that zone would be five (and not six, due to the last rule in the game):
- I max. 5 (R, R, I, I, I)
You do not have the required permissions to view the files attached to this post.