- PowerScore Staff
- Posts: 5948
- Joined: Mar 25, 2011
- Thu Sep 17, 2015 10:47 am
#90470
Setup and Rule Diagram Explanation
This is a Basic Linear: Balanced-Moving, Numerical Distribution game.
The game scenario indicates that seven professors were hired over a period of seven years. That sounds like a recipe for a simple Linear game, but the second-to-last sentence in the scenario indicates that two professors can be hired in the same year and therefore the game is not necessarily in a 1-to-1 assignment ratio. To break down the setup for this game, first we will examine the professors that are hired, then the specialties, and finally the various restrictions governing the hiring and the specialties.
The first rule places M and R, and part of the fifth rule places O:
The second, third, and fifth rules address the specialties (Sp) of the professors, grouping them as follows:
Note that these are not linear blocks, but rather a method to show the grouping of the professors according to shared specialties, and that professors can have other specialties. These specialty groupings have a significant impact on the game when considered in light of the restrictions stated in the game scenario. We will examine those restrictions in a moment.
The fourth rule creates a sequence:
This rule generates its own set of Not Laws and inferences, but we will examine that in connection with the restriction about the specialties.
The game scenario contains two not-block rules involving the specialties:
These extremely restrictive rules about the specialties create a plethora of Not Laws, but also make this game relatively easy. The final setup is created by taking the following steps:
1. Because T shares a specialty with M and O, T cannot be hired in years 89, 90, 91, 92, 93, or 94.
It follows that T must be hired in 95:
2. Due to the sequence, N must be hired in before M; but because N shares a specialty with R, N
cannot be hired in years 90, 91, or 92. Therefore, N must be hired in 89:
3. Due to the sequence, S must be hired after N but before M; since S shares a specialty with O, S
cannot be hired in years 90 or 91. Therefore, S must be hired in 92:
Thus, the only uncertainty in the game is the hiring of P. Since P must be hired after N but before M, P can only be hired in 90, 91, or 92. With so few possibilities, the game is quite easy. This is the final setup:
Note that although this game has only three solutions, this isn’t technically an Identify the Possibilities game because there is no decision to show the possibilities; instead, the natural process of making the setup organically results in all of the variables except one being placed.
This is a Basic Linear: Balanced-Moving, Numerical Distribution game.
The game scenario indicates that seven professors were hired over a period of seven years. That sounds like a recipe for a simple Linear game, but the second-to-last sentence in the scenario indicates that two professors can be hired in the same year and therefore the game is not necessarily in a 1-to-1 assignment ratio. To break down the setup for this game, first we will examine the professors that are hired, then the specialties, and finally the various restrictions governing the hiring and the specialties.
The first rule places M and R, and part of the fifth rule places O:
The second, third, and fifth rules address the specialties (Sp) of the professors, grouping them as follows:
Note that these are not linear blocks, but rather a method to show the grouping of the professors according to shared specialties, and that professors can have other specialties. These specialty groupings have a significant impact on the game when considered in light of the restrictions stated in the game scenario. We will examine those restrictions in a moment.
The fourth rule creates a sequence:
This rule generates its own set of Not Laws and inferences, but we will examine that in connection with the restriction about the specialties.
The game scenario contains two not-block rules involving the specialties:
These extremely restrictive rules about the specialties create a plethora of Not Laws, but also make this game relatively easy. The final setup is created by taking the following steps:
1. Because T shares a specialty with M and O, T cannot be hired in years 89, 90, 91, 92, 93, or 94.
It follows that T must be hired in 95:
2. Due to the sequence, N must be hired in before M; but because N shares a specialty with R, N
cannot be hired in years 90, 91, or 92. Therefore, N must be hired in 89:
3. Due to the sequence, S must be hired after N but before M; since S shares a specialty with O, S
cannot be hired in years 90 or 91. Therefore, S must be hired in 92:
Thus, the only uncertainty in the game is the hiring of P. Since P must be hired after N but before M, P can only be hired in 90, 91, or 92. With so few possibilities, the game is quite easy. This is the final setup:
Note that although this game has only three solutions, this isn’t technically an Identify the Possibilities game because there is no decision to show the possibilities; instead, the natural process of making the setup organically results in all of the variables except one being placed.
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/