- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Wed Jun 25, 2014 10:03 am
#88290
Setup and Rule Diagram Explanation
This is an Advanced Linear: Balanced game.
The linear aspect of this game places three debate teams in order. Each team also has two individual members, and so two spaces are placed above each team for the two members:
With three different stacks for the variables, we have an Advanced Linear game. The challenge within this game will be to track the relationship between the different variable sets, and to place the individual members. The placement of the individual members has a strong Grouping element (so much so that this game could easily be classified as a Grouping/Linear Combination game).
Rule #1. This rule combines one variable from the team variable set with one variable from the member variable set. Given our setup above, this rule should be displayed vertically:
Note that you could place subscripts (“T” for team and “M” for member) on each variable in order to help with the identification. This choice is purely one of personal preference. We will not use subscripts as there are few enough teams and members to track the two sets without subscripts.
Rule #2. This rule assigns T to the second place team. The best representation of this rule is directly on the diagram:
Rule #3. This rule creates a not-block between two members, M and P. The best diagram is a vertical not-block:
As with many not-blocks, there is not initial inference produced by the presence of this rule. M and P still have options for each team and placement position. This rule will come into play once other variables are placed, however.
Rule #4. This rule creates a sequential relationship between two team members, in the form of P N. From the sequence, we can determine that N can never be a member of the first-place team, and P can never be a member of the third-place team. These two inferences can be shown as Not Laws under the member stacks:
Rule #5. This rule creates a sequential relationship between two teams, in the form of G H. From the sequence, we can determine that H can never be the first-place team, and G can never be the third-place team. These two inferences can be shown as Not Laws under the team stack. Of course, because there are only three teams available for each slot, when one team is removed from the running then only two teams remain, creating a dual-option. Thus, either F or G must be the first-place team, and either F or H must be the third-place team:
This rule creates only three possible orders for the three teams: F-G-H, G-F-H, or G-H-F. One option here would be to create three separate templates and explore the options for each. However, we will not pursue this option because, aside from the F-G-H template, the number of different placement options for the members would still be significant.
One aspect of this rule that must be explored is that it contains G, which also appears in the first rule. Because the final rule eliminates G from being the third-place team, connecting that inference to the first rule yields the insight that S can never be a member of the third-place team. This inference can also be shown as a Not Law under the third-place team member spaces.
With S now eliminated from the third-place team, and T (second rule) and P (fourth rule) previously eliminated, only three members are possible candidates for the third-place team: M, N, and O. Thus, if any one of those three members is on a different team, then the remaining two members must be on the third-place team.
Combining all of the above information leads to the final setup for this game:
This is an Advanced Linear: Balanced game.
The linear aspect of this game places three debate teams in order. Each team also has two individual members, and so two spaces are placed above each team for the two members:
With three different stacks for the variables, we have an Advanced Linear game. The challenge within this game will be to track the relationship between the different variable sets, and to place the individual members. The placement of the individual members has a strong Grouping element (so much so that this game could easily be classified as a Grouping/Linear Combination game).
Rule #1. This rule combines one variable from the team variable set with one variable from the member variable set. Given our setup above, this rule should be displayed vertically:
Note that you could place subscripts (“T” for team and “M” for member) on each variable in order to help with the identification. This choice is purely one of personal preference. We will not use subscripts as there are few enough teams and members to track the two sets without subscripts.
Rule #2. This rule assigns T to the second place team. The best representation of this rule is directly on the diagram:
Rule #3. This rule creates a not-block between two members, M and P. The best diagram is a vertical not-block:
As with many not-blocks, there is not initial inference produced by the presence of this rule. M and P still have options for each team and placement position. This rule will come into play once other variables are placed, however.
Rule #4. This rule creates a sequential relationship between two team members, in the form of P N. From the sequence, we can determine that N can never be a member of the first-place team, and P can never be a member of the third-place team. These two inferences can be shown as Not Laws under the member stacks:
Rule #5. This rule creates a sequential relationship between two teams, in the form of G H. From the sequence, we can determine that H can never be the first-place team, and G can never be the third-place team. These two inferences can be shown as Not Laws under the team stack. Of course, because there are only three teams available for each slot, when one team is removed from the running then only two teams remain, creating a dual-option. Thus, either F or G must be the first-place team, and either F or H must be the third-place team:
This rule creates only three possible orders for the three teams: F-G-H, G-F-H, or G-H-F. One option here would be to create three separate templates and explore the options for each. However, we will not pursue this option because, aside from the F-G-H template, the number of different placement options for the members would still be significant.
One aspect of this rule that must be explored is that it contains G, which also appears in the first rule. Because the final rule eliminates G from being the third-place team, connecting that inference to the first rule yields the insight that S can never be a member of the third-place team. This inference can also be shown as a Not Law under the third-place team member spaces.
With S now eliminated from the third-place team, and T (second rule) and P (fourth rule) previously eliminated, only three members are possible candidates for the third-place team: M, N, and O. Thus, if any one of those three members is on a different team, then the remaining two members must be on the third-place team.
Combining all of the above information leads to the final setup for this 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/