by interestedintacos Wed Jan 19, 2011 7:05 am
Ali, that's just the issue: this game doesn't have a set-up, nor would it be helpful to try to create one.
This game is best solved by applying the rules and a very,very simple diagram just showing who goes where and maybe marking the rules to better remember them.
The biggest clue is the way the game is laid out on the page: the game takes up the entire page. The first question is an acceptability question where LSAC decided to vastly spread out the space between each answer choice in order to fill the page. It was a mistake to spend time trying to diagram this one.
Tamwaiman:
Question #23:
Scanning the answer choices, the first ones to consider are obviously the ones having to do with general numbers and not specific people, especially because the two specific people referenced in the answer choices are not specially restricted by the rules:
That leaves choices C, D and E.
Immediately the best choice to consider is choice E because it casts the widest net. This is a "must be true" question so naturally an answer choice that doesn't restrict very much has a greater chance of fitting the "must be true" requirement. Of C, D, and E, E is the best choice to try first, especially knowing we start out with 6 assistants.
Because we know at the beginning there are 6 assistants, and we know that 1 must move up in each year (the key rule that we needed to focus on for this game), we know that after one year there are at most 5 assistants (if only the bare minimum 1 moves up). And obviously after another year, there would be at most 4 assistants--again after the bare minimum requirement is satisfied and only 1 moves up. So we're done; E is correct.
Question #24:
Again, the key rule gives you a quick answer. One must move from each level one level up in each annual review, so we couldn't have 0, because then there would be no one to move up from associate to partner. The lack of any other rules that apply to the situation should lead you to see that you then have the answer: 1 is the minimum.