Q8

[ManhattanPrepLSAT1]

8. (D)
Question Type: Conditional

The question gives us a piece of extra, conditional ("If") information that will apply to this question only: L is never shown again once G is shown. Given this condition, we’re looking for the maximum number of film showings. We already know that Friday and Saturday are limited to two showings each. So, even without the new condition, we can have a max of seven showings. Let’s see if we can make the condition work with seven showings.
To start, we’d need to fill all of Thursday’s slots. We know that H has to be last on Thursday, and the new condition says that L would have to come before G. We can do this: L first, G second, H third.
We must keep in mind, however, that we can’t use any more L’s (since G has been shown). So, for Friday we’d have to do: H first, G second (since G would need to be last). So far so good! We have a problem with Saturday, though. We can’t use any more L’s, and we can’t show both G and H on Saturday. Thus, we can only show one film on Saturday, G or H.
Given the constraint, we can’t show seven films, but we just proved that six is possible.

[ManhattanPrepLSAT1]

[KatiaK713]

Hi,
Since we are looking for the maximum, wouldn't it make sense to see what happens if we schedule G as late as possible (starting with Saturday, not with Thursday)? We would get the same 6 shows: Thursday: L+H Friday: H+L Saturday:L+G

[ohthatpatrick]

Yeah, I see your logic.

He's starting from a perspective of, "Let's work our way down from the maximum number of spots".

You're starting from a perspective of, "Let's save G for as late in the week as possible, so that we don't deprive ourselves of L's."
(of course, by doing so, we're depriving ourselves of G's on Thu and Fri)

They're both equally valid ways of getting to this answer I think.