- Sun Jan 20, 2013 12:00 am
#28485
Complete Setup and Rule Diagram Explanation
This is a Basic Linear Game: Balanced, Identify the Templates.
The key to this game is to use the last rule to create the two mutually exclusive sequences that control this game.
From the game scenario, we know the following linear scenario underpins the sequences:
Because there are no ties, this is a balanced game, wherein each of the six hotel suites is assigned to a different space.
Ultimately, the final rule controls the game , and students who begin diagramming before reading all of the rules often find themselves scrambling to re-diagram. Remember, always read the entire scenario and accompanying rules prior to starting your diagram.
For the purpose of clarity, let’s review each rule individually. At the conclusion of showing the diagram for each rule, we will combine the diagrams into two super-sequences.
This template is produced by the part of rule #4 that produces the H F G sequence. To build a super-sequence that captures the relationship between all six hotel suites, first add rule #1 to the sequence:
The next step is to add rule #3 to the sequence (rule #2 does not apply to this sequence, and can be ignored). This step is more difficult than the first step above, because adding the third rule creates an unwieldy diagram:
The relationship between K, J, and L is clear when isolated in rule #3, but when added to a sequence where L is already less expensive than another hotel suite, H, the relationship is a bit more difficult to diagram. In the above diagram, K and H have no relationship other than both being more expensive than L.
The tricky part comes in analyzing the relationship between H and J, and between K and F G. In both instances, there is no relationship. That is, J can be more or less expensive than H, and K can be more or less expensive than both F or G. Of course, this difficulty in representation and analysis is exactly what the test makers intended.
To better understand the possibilities inherent in this sequence, consider the following hypotheticals, all of which are valid:
Sequence Template #2
This template is produced by the part of rule #4 that produces the G F H sequence. To build a super-sequence that captures the relationship between all six hotel suites, first add rule #1 to the sequence:
The next step is to add rule #2 to the sequence (rule #3 does not apply to this sequence, and can be ignored). This step is more difficult than the first step above because adding the second rule creates a slightly unwieldy diagram:
The relationship between K, J, and L is clear when isolated in rule #2, but when added to a sequence where L is already less expensive than three other hotel suites, the relationship is more difficult to diagram (although not as troubling as the first sequence template). The tricky part comes in analyzing the relationship between J and K and the other variables. J must be more expensive than K and L, but J has no relationship with G, F, or H. Similarly, K must be less expensive than J but otherwise K has no relationship with any other variable in the chain. Analyzing which variables can be first and which can be last in the sequence above, only G or J can be first, and only K or L can be last.
To better understand the possibilities inherent in this sequence, consider the following hypotheticals, each of which is valid:
Use the two sequence templates to answer the questions.
This is a Basic Linear Game: Balanced, Identify the Templates.
The key to this game is to use the last rule to create the two mutually exclusive sequences that control this game.
From the game scenario, we know the following linear scenario underpins the sequences:
Because there are no ties, this is a balanced game, wherein each of the six hotel suites is assigned to a different space.
Ultimately, the final rule controls the game , and students who begin diagramming before reading all of the rules often find themselves scrambling to re-diagram. Remember, always read the entire scenario and accompanying rules prior to starting your diagram.
For the purpose of clarity, let’s review each rule individually. At the conclusion of showing the diagram for each rule, we will combine the diagrams into two super-sequences.
- Rule #1. This is a basic sequential rule:
H L
Rule #2. This is a conditional rule, and the sufficient condition is that G is more expensive than H. When that occurs, then J is more expensive than both K and L:
Rule #3. This is another conditional rule, and the sufficient condition is that H is more expensive than G. When that occurs, then K is more expensive than both J and L:
Rule #4. Initially this rule seems like a simple either/or rule, where F is either more expensive than G (diagrammed as F G) or F is more expensive than H (diagrammed as F H). However, the “but not both” portion of the rule means that F is more expensive than only one of G or H at a time, and since there are no ties, that means that the other variable must be more expensive than F. So, when F is more expensive than G, then H must be more expensive than F, producing the following sequence:
H F G
And, when F is more expensive than H, then G must be more expensive than F, producing the following sequence:
G F H
Every game solution must conform to one of the two sequences produced by rule #4, and thus you should take those two base sequences and create two templates for the game.
This template is produced by the part of rule #4 that produces the H F G sequence. To build a super-sequence that captures the relationship between all six hotel suites, first add rule #1 to the sequence:
The next step is to add rule #3 to the sequence (rule #2 does not apply to this sequence, and can be ignored). This step is more difficult than the first step above, because adding the third rule creates an unwieldy diagram:
The relationship between K, J, and L is clear when isolated in rule #3, but when added to a sequence where L is already less expensive than another hotel suite, H, the relationship is a bit more difficult to diagram. In the above diagram, K and H have no relationship other than both being more expensive than L.
The tricky part comes in analyzing the relationship between H and J, and between K and F G. In both instances, there is no relationship. That is, J can be more or less expensive than H, and K can be more or less expensive than both F or G. Of course, this difficulty in representation and analysis is exactly what the test makers intended.
To better understand the possibilities inherent in this sequence, consider the following hypotheticals, all of which are valid:
- Hypothetical 1: K - H - F - G - J - L
Hypothetical 2: K - J - H - L - F - G
Hypothetical 3: H - F - G - K - L - J
Hypothetical 4: H - F - K - J - G - L
Hypothetical 5: H - K - L - F - G - J
Sequence Template #2
This template is produced by the part of rule #4 that produces the G F H sequence. To build a super-sequence that captures the relationship between all six hotel suites, first add rule #1 to the sequence:
- G F H L
The next step is to add rule #2 to the sequence (rule #3 does not apply to this sequence, and can be ignored). This step is more difficult than the first step above because adding the second rule creates a slightly unwieldy diagram:
The relationship between K, J, and L is clear when isolated in rule #2, but when added to a sequence where L is already less expensive than three other hotel suites, the relationship is more difficult to diagram (although not as troubling as the first sequence template). The tricky part comes in analyzing the relationship between J and K and the other variables. J must be more expensive than K and L, but J has no relationship with G, F, or H. Similarly, K must be less expensive than J but otherwise K has no relationship with any other variable in the chain. Analyzing which variables can be first and which can be last in the sequence above, only G or J can be first, and only K or L can be last.
To better understand the possibilities inherent in this sequence, consider the following hypotheticals, each of which is valid:
- Hypothetical 1: G - F - H - J - L - K
Hypothetical 2: J - K - G - F - H - L
Hypothetical 3: J - G - F - H - L - K
Hypothetical 4: G - J - F - K - H - L
Hypothetical 5: G - F - J - H - K - L
Use the two sequence templates to answer the questions.
You do not have the required permissions to view the files attached to this post.