- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Sun Jan 20, 2013 12:00 am
#46118
Setup and Rule Diagram Explanation
This is a Grouping: Undefined game.
This game is difficult for two primary reasons. First, the number of applicants interviewed and hired is Undefined. As mentioned elsewhere, Undefined grouping games are generally harder than Defined grouping games because Undefined games have a relatively greater number of solutions, and the lack of certainty in the setup forces the test taker to remember extra elements throughout the game. Second, the two groups are linked. Generally, Grouping games feature separate groups with no true interrelation. For example, a game might feature children in separate canoes. Once a child has been placed in one canoe, he or she is then prevented from being in the other canoe and can be taken out of the variable pool. In this game, however, applicants who are hired must first “pass through” the interview group. Thus, an applicant who is placed into the interview group may or may not proceed to the hiring group. This effectively keeps variables “alive” even though they have already been placed once.
The basic scenario for the game appears as follows, with the relationship between Hired and Interviewed shown with an arrow indicating if an applicant is hired, they must have been interviewed first.
Thus, to be hired, an applicant must be interviewed. The contrapositive of that rule indicates that if an applicant is not interviewed, then they cannot be hired. So, any Not Law that appears under the Interviewed group will automatically result in the same Not Law appearing under the Hired group.
The third rule establishes that F is interviewed, which can be shown directly on the diagram:
The remaining rules are conditional in nature. When diagramming these rules, use subscript designations for interviewing (I) and hiring (H):
The first two rules can also be combined to form a conditional chain:
Note the importance of L in the above chain: if L is not interviewed (and thus not hired), then neither G nor J can be interviewed or hired.
It is also important to keep in mind the contrapositive of each rule. For example, the contrapositive of the fifth rule would state that “if M is not interviewed then K is not hired.” Thus, in a question like #8, where M is not interviewed, you immediately know that K cannot be hired. Remember, when conditional statements are presented in a form that is in any way unusual, always take the contrapositive.
The information above can be used to form the final diagram for the game:
This is a Grouping: Undefined game.
This game is difficult for two primary reasons. First, the number of applicants interviewed and hired is Undefined. As mentioned elsewhere, Undefined grouping games are generally harder than Defined grouping games because Undefined games have a relatively greater number of solutions, and the lack of certainty in the setup forces the test taker to remember extra elements throughout the game. Second, the two groups are linked. Generally, Grouping games feature separate groups with no true interrelation. For example, a game might feature children in separate canoes. Once a child has been placed in one canoe, he or she is then prevented from being in the other canoe and can be taken out of the variable pool. In this game, however, applicants who are hired must first “pass through” the interview group. Thus, an applicant who is placed into the interview group may or may not proceed to the hiring group. This effectively keeps variables “alive” even though they have already been placed once.
The basic scenario for the game appears as follows, with the relationship between Hired and Interviewed shown with an arrow indicating if an applicant is hired, they must have been interviewed first.
Thus, to be hired, an applicant must be interviewed. The contrapositive of that rule indicates that if an applicant is not interviewed, then they cannot be hired. So, any Not Law that appears under the Interviewed group will automatically result in the same Not Law appearing under the Hired group.
The third rule establishes that F is interviewed, which can be shown directly on the diagram:
The remaining rules are conditional in nature. When diagramming these rules, use subscript designations for interviewing (I) and hiring (H):
The first two rules can also be combined to form a conditional chain:
Note the importance of L in the above chain: if L is not interviewed (and thus not hired), then neither G nor J can be interviewed or hired.
It is also important to keep in mind the contrapositive of each rule. For example, the contrapositive of the fifth rule would state that “if M is not interviewed then K is not hired.” Thus, in a question like #8, where M is not interviewed, you immediately know that K cannot be hired. Remember, when conditional statements are presented in a form that is in any way unusual, always take the contrapositive.
The information above can be used to form the final diagram for the game:
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/