- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Sat Jun 23, 2012 9:55 am
#88204
Setup and Rule Diagram Explanation
This is a Basic Linear: Balanced, Identify the Templates game.
This game scenario presents a situation where six contract bids each have a different cost, and only one of the bids is accepted. This creates a linear scenario where the six bids are ordered based on cost, with “1” representing the lowest-cost bid and “6” representing the highest-cost bid:
The implications of “1” equalling the lowest-cost bid will be discussed later.
The sentence stating that “Exactly one of the bids is accepted” initially causes some students to reasonably wonder if the accepted bid must be the first, or lowest-cost, bid. Fortunately, the first rule eliminates this confusion by establishing that either the second or third bid is the accepted bid.
Within the setup, because there is only one accepted bid, instead of creating a second stack of variables for “accepted” and “not accepted,” we will instead use a sub-A on the second and third positions to designate that one of those bids is accepted:
This notation effectively represents the presence of the accepted bid without undue confusion or additional work.
Rule #1. The portion of this rule that states that the accepted bid is second or third lowest in cost has already been addressed. The portion of this rule indicating that K or R is the accepted bid does not mean that K and R are second and third in some order. Instead, the rule means that at least one of K or R is always second or third (and thus K/R dual-options cannot be placed on both the second and third slots). This portion of the rule can be represented as:
Rule #2. This rule can be represented as:
For some students, this is the point in the game where the lowest-cost bid being first creates a problem. “Lowest” often means “least” or “worst,” so students working through this game have to realize that the test makers have set up the lowest bid as the “best.” This is similar to golf, where lower scores are preferable.
Of course, this sequence generates several Not Laws. H cannot be the fifth or sixth bid, and J and K cannot be the first bid:
Rules #3 and #4. Given that these two rules create mutually exclusive situations, we will address them after reviewing the last rule.
Rule #4. This rule creates an R/S dual-option on the fifth space. When combined with the second rule, this causes a problem for the possible placements of H. With the fifth space effectively filled, H can no longer be fourth, otherwise there would be insufficient room for J and K. Hence, an H Not Law can be placed on the fourth space:
In essence, filling the fifth space with variables other than H has transferred the H Not Law that used to be on the fifth space to the fourth space.
At this point, we can return to the third and fourth rules.
Rules #3 and #4. The sufficient conditions in these two rules create two separate templates that will cover all possibilities (because J has only two options (fourth or not fourth)). Consequently, the best approach is to examine the templates that occur under each rule.
Rule #3. When J is fourth, both S and T are higher in cost, which can be represented as:
Because from the last rule we know that either R or S must be fifth, when the above rule is in force then J is fourth, S is fifth, and T is sixth:
The three remaining variables are H, K, and R, and those variables must still meet the requirements of the first and second rules. Thus, H R (meaning that H cannot be third and K cannot be first) and K or R still meets the first rule:
Rule #4. When J is not fourth, then S and T are less expensive than J:
While this relationship may not initially appear to yield any inferences other than standard Not Laws, a closer examination yields that this rule, in combination with the others, has a decisive impact on J.
Under this rule, J cannot be first or second because S and T are both less expensive than J. However, one of the second or third spaces is always filled by either K or R, which effectively adds a space in front of J. For example, if K is accepted and K is the second bid, then S and T still have to be ahead of J, and J cannot be first, second, or third. This same type of reasoning applies to every scenario involving the accepted bid (which is always second or third, and hence presents problems for J). Thus, J can never be first, second or third under the fourth rule. Of course, the rule itself eliminates J from the fourth position, and since the last rule establishes that R or S must be fifth, we can then infer that when J is not fourth, there is no other option than for J to be sixth.
While the combination of the third and fourth rules establishes the inference that J is always fourth or sixth, the templates will also contain this information. The next step is to use the last rule to split the “J not fourth” template into two options, one when R is fifth and one when S is fifth. In each case, J must be sixth.
The three templates combine to lead to the complete setup for the game:
This is a Basic Linear: Balanced, Identify the Templates game.
This game scenario presents a situation where six contract bids each have a different cost, and only one of the bids is accepted. This creates a linear scenario where the six bids are ordered based on cost, with “1” representing the lowest-cost bid and “6” representing the highest-cost bid:
The implications of “1” equalling the lowest-cost bid will be discussed later.
The sentence stating that “Exactly one of the bids is accepted” initially causes some students to reasonably wonder if the accepted bid must be the first, or lowest-cost, bid. Fortunately, the first rule eliminates this confusion by establishing that either the second or third bid is the accepted bid.
Within the setup, because there is only one accepted bid, instead of creating a second stack of variables for “accepted” and “not accepted,” we will instead use a sub-A on the second and third positions to designate that one of those bids is accepted:
This notation effectively represents the presence of the accepted bid without undue confusion or additional work.
Rule #1. The portion of this rule that states that the accepted bid is second or third lowest in cost has already been addressed. The portion of this rule indicating that K or R is the accepted bid does not mean that K and R are second and third in some order. Instead, the rule means that at least one of K or R is always second or third (and thus K/R dual-options cannot be placed on both the second and third slots). This portion of the rule can be represented as:
Rule #2. This rule can be represented as:
For some students, this is the point in the game where the lowest-cost bid being first creates a problem. “Lowest” often means “least” or “worst,” so students working through this game have to realize that the test makers have set up the lowest bid as the “best.” This is similar to golf, where lower scores are preferable.
Of course, this sequence generates several Not Laws. H cannot be the fifth or sixth bid, and J and K cannot be the first bid:
Rules #3 and #4. Given that these two rules create mutually exclusive situations, we will address them after reviewing the last rule.
Rule #4. This rule creates an R/S dual-option on the fifth space. When combined with the second rule, this causes a problem for the possible placements of H. With the fifth space effectively filled, H can no longer be fourth, otherwise there would be insufficient room for J and K. Hence, an H Not Law can be placed on the fourth space:
In essence, filling the fifth space with variables other than H has transferred the H Not Law that used to be on the fifth space to the fourth space.
At this point, we can return to the third and fourth rules.
Rules #3 and #4. The sufficient conditions in these two rules create two separate templates that will cover all possibilities (because J has only two options (fourth or not fourth)). Consequently, the best approach is to examine the templates that occur under each rule.
Rule #3. When J is fourth, both S and T are higher in cost, which can be represented as:
Because from the last rule we know that either R or S must be fifth, when the above rule is in force then J is fourth, S is fifth, and T is sixth:
The three remaining variables are H, K, and R, and those variables must still meet the requirements of the first and second rules. Thus, H R (meaning that H cannot be third and K cannot be first) and K or R still meets the first rule:
Template #1: J is fourth
Rule #4. When J is not fourth, then S and T are less expensive than J:
While this relationship may not initially appear to yield any inferences other than standard Not Laws, a closer examination yields that this rule, in combination with the others, has a decisive impact on J.
Under this rule, J cannot be first or second because S and T are both less expensive than J. However, one of the second or third spaces is always filled by either K or R, which effectively adds a space in front of J. For example, if K is accepted and K is the second bid, then S and T still have to be ahead of J, and J cannot be first, second, or third. This same type of reasoning applies to every scenario involving the accepted bid (which is always second or third, and hence presents problems for J). Thus, J can never be first, second or third under the fourth rule. Of course, the rule itself eliminates J from the fourth position, and since the last rule establishes that R or S must be fifth, we can then infer that when J is not fourth, there is no other option than for J to be sixth.
While the combination of the third and fourth rules establishes the inference that J is always fourth or sixth, the templates will also contain this information. The next step is to use the last rule to split the “J not fourth” template into two options, one when R is fifth and one when S is fifth. In each case, J must be sixth.
Template #2: J is not fourth, R is fifth
In this template, J must be sixth (from the inference discussed above), and R is fifth. From the first rule, K must then be the accepted bid, and thus K must be second or third.
From the second rule, H must be less expensive than K, and thus H must be first or second.
With R, J, H, and K accounted for, only S or T can be fourth. The remainder of S and T is one of the first three bids, leading to the following template diagram:
Template #3: J is not fourth, S is fifth
In this template, J must be sixth (from the inference discussed previously), and S is fifth. From the first rule, K must then be the accepted bid, and thus K must be second or third.
From the second rule, H must be less expensive than K (H K), and from the first rule K or R must be second or third. This information leads to a template diagram that is considerably more open:
The three templates combine to lead to the complete setup 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/