- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Wed Jan 20, 2010 12:00 am
#60208
Setup and Rule Diagram Explanation
This is an Undefined Grouping Game.
The game is Undefined because we do not know how many photographs are displayed in the album, nor do we know exactly how many people are in a photograph. With these elements unspecified, we cannot create a diagram in the traditional sense; that is, we cannot create a group of say, five spaces and then place variables in those spaces. Instead, we must diagram the rules and make inferences, and then proceed to the questions without a defined group in place.
The Rules
Rule #1. One of the easiest mistakes to make in this game is to misinterpret the wording in each of the rules. This rule indicates that whenever S appears in a photograph, then W appears in that same photograph. The correct diagram for that relationship is:
S W
Many students mistakenly reverse the above diagram. To avoid doing so, consider the rule for a moment: does the rule say that every time W appears in a photograph that S also appears? No. Although the difference is subtle, the wording in the rule is that W appears in every photograph that S appears in. Thus, S is the sufficient condition, and the appearance of S indicates that W will appear in that same photograph.
Rule #2. The wording in this rule is identical to the wording in rule #1, and so it is just as easy to make an error when diagramming this rule. The correct diagram is:
U S
When we get to the “Inference” section we will discuss how the first and second rules can be linked. Also, note that since both of the first two rules are “positive” (no negative terms involved) we are not diagramming contrapositives since you should know those as an automatic result of seeing any conditional statement.
Rule #3. This is also a tricky rule, not only because of the wording, but also because the conditional relationship between R and Y is easy to misunderstand. First, let us diagram the rule:
Y R
Since this rule contains a negative, let us also diagram the contrapositive:
R Y
Many students will interpret these two diagrams as reduced to a simple double-not arrow relationship: Y R. This is not the meaning of the rule! Instead, consider the exact relationship between Y and R: when Y is not in the photograph, then R must be in the photograph; and, via the contrapositive, when R is not in the photograph, then Y must be in the photograph. Thus, when one of the two is not in the photograph, the other must be in the photograph, and that relationship can best be expressed by stating that both cannot be absent from the photograph. The correct double-not arrow diagram, then, is:
R Y
The operating result of this rule is that either Y or R, or both, must appear in each photograph (note that R and Y can appear in a photograph together; the rule does not prohibit this occurrence).
Rule #4. This rule is actually two rules in one: one rule states that T and W do not appear in the same photograph, and the other states that R and W do not appear in the same photograph. Let’s consider each part separately.
As stated directly, when W is in a photograph, T is not in that same photograph:
W T
This rule can be turned into the a double-not arrow indicating that T and W are never in the same photograph:
W T
The other part of the rule states that when W is in a photograph, R is not in that same photograph:
W R
This rule can be turned into the a double-not arrow indicating that R and W are never in the same photograph:
W R
One note about the rules: every variable is mentioned in the rules except Z. Thus, Z is a random in this game, and since there is not a specified number of spaces, Z is largely powerless in this game. If a question stem includes Z as part of a local condition, there must be other information included in the question stem, and you should focus on the other information first.
In review, the four rules contain five basic grouping relationships that create many different inferences. When you consider the four rules, you can see that the test makers placed a trap for the unwary student. A student who quickly reads through the rules and does not read for meaning can easily mis-diagram one or more of the rules, and of course mis-diagramming during the setup is almost always costly.
After correctly negotiating each of the rule diagrams, the next step is to make inferences by connecting the rules. In this game, there are many inferences, and so the challenge becomes managing the information.
The Inferences
Inference #1. By connecting the first and second rules, we can create the following chain:
U S W
This connection is important because it shows that if U appears in a photograph then two other friends must also appear in that same photograph. Via the contrapositive, the relationship also indicates that if W does not appear in a photograph, then neither S nor U can appear in that photograph.
Inferences #2 and #3. The first and fourth rules can be connected through W:
S W T
+
S W R
These two relationships yield the following inferences:
S T
+
S R
Inferences #4 and #5. The two previous inferences connected S to T and R through S’s relationship with W. Since U also has a relationship with S from the second rule, we can connect the second rule to inferences we just made:
U S T
+
U S R
These two relationships yield the following inferences:
U T
+
U R
Inference #6. Because R appears in the third and fourth rules, we can make a connection using R:
Y R W
This relationship results in the unique inference that:
Y W
Because both conditions are negative, take the contrapositive:
W Y
Thus, if W appears in a photograph, then Y must appear in that photograph as well.
Inferences #7 and #8. From the inference we just made we know that when W is in a photograph, then Y must also be in that photograph. We can add this to the chain that appeared in inference #1 (which was the combination of the first two rules):
U S W Y
These relationships yield the following two inferences:
S Y
+
U Y
Thus, the appearance of either S or U will ultimately force Y to appear. This makes U a powerful variable: when U appears in a photograph, then S, W, and Y must also appear, and R and T cannot appear. Thus, the appearance of U allows for only two solutions, depending on whether Z is in the photograph.
There are other ways to arrive at some of these inferences (for example, when S has a relationship with a variable, U has the same relationship because of the second rule), but each inference above is a product of combining the rules or of combining the rules and inferences (do not forget to recycle your inferences!).
Compiling all of the information above, we arrive at the final setup for this game:
As long as you focus on connecting the variables in the rules and inferences, you can attack the questions and complete each problem with relative ease. Remember, this game is not logically difficult; it is simply an information management game, so do not be intimidated!
This is an Undefined Grouping Game.
The game is Undefined because we do not know how many photographs are displayed in the album, nor do we know exactly how many people are in a photograph. With these elements unspecified, we cannot create a diagram in the traditional sense; that is, we cannot create a group of say, five spaces and then place variables in those spaces. Instead, we must diagram the rules and make inferences, and then proceed to the questions without a defined group in place.
The Rules
Rule #1. One of the easiest mistakes to make in this game is to misinterpret the wording in each of the rules. This rule indicates that whenever S appears in a photograph, then W appears in that same photograph. The correct diagram for that relationship is:
S W
Many students mistakenly reverse the above diagram. To avoid doing so, consider the rule for a moment: does the rule say that every time W appears in a photograph that S also appears? No. Although the difference is subtle, the wording in the rule is that W appears in every photograph that S appears in. Thus, S is the sufficient condition, and the appearance of S indicates that W will appear in that same photograph.
Rule #2. The wording in this rule is identical to the wording in rule #1, and so it is just as easy to make an error when diagramming this rule. The correct diagram is:
U S
When we get to the “Inference” section we will discuss how the first and second rules can be linked. Also, note that since both of the first two rules are “positive” (no negative terms involved) we are not diagramming contrapositives since you should know those as an automatic result of seeing any conditional statement.
Rule #3. This is also a tricky rule, not only because of the wording, but also because the conditional relationship between R and Y is easy to misunderstand. First, let us diagram the rule:
Y R
Since this rule contains a negative, let us also diagram the contrapositive:
R Y
Many students will interpret these two diagrams as reduced to a simple double-not arrow relationship: Y R. This is not the meaning of the rule! Instead, consider the exact relationship between Y and R: when Y is not in the photograph, then R must be in the photograph; and, via the contrapositive, when R is not in the photograph, then Y must be in the photograph. Thus, when one of the two is not in the photograph, the other must be in the photograph, and that relationship can best be expressed by stating that both cannot be absent from the photograph. The correct double-not arrow diagram, then, is:
R Y
The operating result of this rule is that either Y or R, or both, must appear in each photograph (note that R and Y can appear in a photograph together; the rule does not prohibit this occurrence).
Rule #4. This rule is actually two rules in one: one rule states that T and W do not appear in the same photograph, and the other states that R and W do not appear in the same photograph. Let’s consider each part separately.
As stated directly, when W is in a photograph, T is not in that same photograph:
W T
This rule can be turned into the a double-not arrow indicating that T and W are never in the same photograph:
W T
The other part of the rule states that when W is in a photograph, R is not in that same photograph:
W R
This rule can be turned into the a double-not arrow indicating that R and W are never in the same photograph:
W R
One note about the rules: every variable is mentioned in the rules except Z. Thus, Z is a random in this game, and since there is not a specified number of spaces, Z is largely powerless in this game. If a question stem includes Z as part of a local condition, there must be other information included in the question stem, and you should focus on the other information first.
In review, the four rules contain five basic grouping relationships that create many different inferences. When you consider the four rules, you can see that the test makers placed a trap for the unwary student. A student who quickly reads through the rules and does not read for meaning can easily mis-diagram one or more of the rules, and of course mis-diagramming during the setup is almost always costly.
After correctly negotiating each of the rule diagrams, the next step is to make inferences by connecting the rules. In this game, there are many inferences, and so the challenge becomes managing the information.
The Inferences
Inference #1. By connecting the first and second rules, we can create the following chain:
U S W
This connection is important because it shows that if U appears in a photograph then two other friends must also appear in that same photograph. Via the contrapositive, the relationship also indicates that if W does not appear in a photograph, then neither S nor U can appear in that photograph.
Inferences #2 and #3. The first and fourth rules can be connected through W:
S W T
+
S W R
These two relationships yield the following inferences:
S T
+
S R
Inferences #4 and #5. The two previous inferences connected S to T and R through S’s relationship with W. Since U also has a relationship with S from the second rule, we can connect the second rule to inferences we just made:
U S T
+
U S R
These two relationships yield the following inferences:
U T
+
U R
Inference #6. Because R appears in the third and fourth rules, we can make a connection using R:
Y R W
This relationship results in the unique inference that:
Y W
Because both conditions are negative, take the contrapositive:
W Y
Thus, if W appears in a photograph, then Y must appear in that photograph as well.
Inferences #7 and #8. From the inference we just made we know that when W is in a photograph, then Y must also be in that photograph. We can add this to the chain that appeared in inference #1 (which was the combination of the first two rules):
U S W Y
These relationships yield the following two inferences:
S Y
+
U Y
Thus, the appearance of either S or U will ultimately force Y to appear. This makes U a powerful variable: when U appears in a photograph, then S, W, and Y must also appear, and R and T cannot appear. Thus, the appearance of U allows for only two solutions, depending on whether Z is in the photograph.
There are other ways to arrive at some of these inferences (for example, when S has a relationship with a variable, U has the same relationship because of the second rule), but each inference above is a product of combining the rules or of combining the rules and inferences (do not forget to recycle your inferences!).
Compiling all of the information above, we arrive at the final setup for this game:
As long as you focus on connecting the variables in the rules and inferences, you can attack the questions and complete each problem with relative ease. Remember, this game is not logically difficult; it is simply an information management game, so do not be intimidated!
You do not have the required permissions to view the files attached to this post.
Dave Killoran
PowerScore Test Preparation
Follow me on X/Twitter at http://twitter.com/DaveKilloran
My LSAT Articles: http://blog.powerscore.com/lsat/author/dave-killoran
PowerScore Podcast: http://www.powerscore.com/lsat/podcast/
PowerScore Test Preparation
Follow me on X/Twitter at http://twitter.com/DaveKilloran
My LSAT Articles: http://blog.powerscore.com/lsat/author/dave-killoran
PowerScore Podcast: http://www.powerscore.com/lsat/podcast/