- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Tue Jul 19, 2016 4:08 pm
#27315
Setup and Rule Diagram Explanation
This is a Grouping: Defined—Moving, Balanced, Numerical Distribution, Identify the Possibilities game.
This game features seven flavorings included in two dishes (7 2). The first rule establishes a limitation on the number of flavorings in the appetizer (a maximum of 3), and thus the stage is set for a Numerical Distribution. Initially, the following distributions appear possible:
However, the second and third rules create two not-blocks (more on these in a moment), and because every flavoring must be used, these two rules mean that the appetizer cannot have 0 or 1 flavorings. Thus, there are only two possible fixed distributions in the game:
To recount, the 0-7 and 1-6 distributions are impossible because they would force either F and N, or S and T, or both together.
The second and third rules establish two not-blocks:
Essentially, each block results in a space in each dish being “reserved” for the members of each pair:
The fourth rule creates a block:
By combining the second and fourth rules, the additional inference that F and G cannot be included in the same recipe together can be drawn:
L and P do not appear in any of the rules, meaning they are randoms. That will be shown on the next diagram with asterisks. At this point, the diagram would appear as follows:
Because of the numerical distribution and the restrictive nature of the rules, this game can be attacked by Identifying the Possibilities:
There are only eight solutions to this game:
This is a Grouping: Defined—Moving, Balanced, Numerical Distribution, Identify the Possibilities game.
This game features seven flavorings included in two dishes (7 2). The first rule establishes a limitation on the number of flavorings in the appetizer (a maximum of 3), and thus the stage is set for a Numerical Distribution. Initially, the following distributions appear possible:
However, the second and third rules create two not-blocks (more on these in a moment), and because every flavoring must be used, these two rules mean that the appetizer cannot have 0 or 1 flavorings. Thus, there are only two possible fixed distributions in the game:
To recount, the 0-7 and 1-6 distributions are impossible because they would force either F and N, or S and T, or both together.
The second and third rules establish two not-blocks:
Essentially, each block results in a space in each dish being “reserved” for the members of each pair:
The fourth rule creates a block:
By combining the second and fourth rules, the additional inference that F and G cannot be included in the same recipe together can be drawn:
L and P do not appear in any of the rules, meaning they are randoms. That will be shown on the next diagram with asterisks. At this point, the diagram would appear as follows:
Because of the numerical distribution and the restrictive nature of the rules, this game can be attacked by Identifying the Possibilities:
There are only eight solutions to 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/