- Sat Jan 21, 2012 12:00 am
#25647
Complete Question Explanation
(The complete setup for this game can be found here: lsat/viewtopic.php?t=7800)
The correct answer choice is (D)
This question stem establishes that T is visited fifth. Since the same destination cannot be visited
in two consecutive weeks, it follows that T cannot be visited fourth. Additionally, visiting J
requires the creation of a GJ Block, which would be impossible if J were visited six:
At this point, it would be critical to focus on the most restricted variable in our game – J. J cannot
be visited fourth (first rule), and it also cannot be visited first as a result of the fourth rule.
Therefore, J must be visited either second or third, but not both (which would violate both the
fourth and the fifth rules). In either case, we must ensure that G is visited immediately before J:
At this point, we need to consider the M > G > M sequence. In the first local diagram above, the
sequence can be satisfied if G is also visited fourth (remember – each destination can be visited
more than once):
In the second local diagram, M must be visited first, and again either fourth or sixth. If M is
visited fourth, the sixth destination would be none other than G; likewise, if M is visited sixth, the
fourth destination must be G:
These solutions show that answer choice (D) could be true, as M could be visited fourth. None of
the other answer choices are possible under the condition established by the question stem.
(The complete setup for this game can be found here: lsat/viewtopic.php?t=7800)
The correct answer choice is (D)
This question stem establishes that T is visited fifth. Since the same destination cannot be visited
in two consecutive weeks, it follows that T cannot be visited fourth. Additionally, visiting J
requires the creation of a GJ Block, which would be impossible if J were visited six:
At this point, it would be critical to focus on the most restricted variable in our game – J. J cannot
be visited fourth (first rule), and it also cannot be visited first as a result of the fourth rule.
Therefore, J must be visited either second or third, but not both (which would violate both the
fourth and the fifth rules). In either case, we must ensure that G is visited immediately before J:
At this point, we need to consider the M > G > M sequence. In the first local diagram above, the
sequence can be satisfied if G is also visited fourth (remember – each destination can be visited
more than once):
In the second local diagram, M must be visited first, and again either fourth or sixth. If M is
visited fourth, the sixth destination would be none other than G; likewise, if M is visited sixth, the
fourth destination must be G:
These solutions show that answer choice (D) could be true, as M could be visited fourth. None of
the other answer choices are possible under the condition established by the question stem.
You do not have the required permissions to view the files attached to this post.