- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Fri Jan 21, 2011 12:00 am
#43590
Setup and Rule Diagram Explanation
This is a Grouping: Defined-Moving, Balanced, Numerical Distribution game.
One popular approach to this game is to use the seven judges as the base. While this approach can work, separating the judges into the For and Against groups is more effective, in part because it turns the game into a two-value system, which has a dramatic effect on the contrapositive of several rules, and in part because it better captures the fact that there are at least two judges in each group. Remember, always look to first establish the composition of the groups in any game. In this case, because each group has at least two votes, there are two unfixed numerical distributions in operation: 5-2 and 4-3.
The only way to track the variables in the rules is to use subscripts indicating which way each judge voted.
The key inference to this game is that at least one L must vote for Datalog because all three cannot vote against Datalog. If all three L’s attempted to vote against Datalog, then both C’s would have to vote for Datalog, which is impossible according to the given rules.
Once it has been established that at least one L must vote for Datalog, this information can be applied to the other rules and it can be inferred that when the CCL block occurs it must occur on the Against side, and also that when the LLL block occurs it must occur on the For side. This understanding helps eliminate some of the uncertainty that initially appears to be present in this difficult game.
The LLL rule yields an interesting inference via the contrapositive, that if one C votes for Datalog, then at least one L votes against Datalog. This inference is largely useless in the game.
This is a Grouping: Defined-Moving, Balanced, Numerical Distribution game.
One popular approach to this game is to use the seven judges as the base. While this approach can work, separating the judges into the For and Against groups is more effective, in part because it turns the game into a two-value system, which has a dramatic effect on the contrapositive of several rules, and in part because it better captures the fact that there are at least two judges in each group. Remember, always look to first establish the composition of the groups in any game. In this case, because each group has at least two votes, there are two unfixed numerical distributions in operation: 5-2 and 4-3.
The only way to track the variables in the rules is to use subscripts indicating which way each judge voted.
The key inference to this game is that at least one L must vote for Datalog because all three cannot vote against Datalog. If all three L’s attempted to vote against Datalog, then both C’s would have to vote for Datalog, which is impossible according to the given rules.
Once it has been established that at least one L must vote for Datalog, this information can be applied to the other rules and it can be inferred that when the CCL block occurs it must occur on the Against side, and also that when the LLL block occurs it must occur on the For side. This understanding helps eliminate some of the uncertainty that initially appears to be present in this difficult game.
The LLL rule yields an interesting inference via the contrapositive, that if one C votes for Datalog, then at least one L votes against Datalog. This inference is largely useless in 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/