justnomore.3x5s
Thanks Received: 0
Forum Guests
 
Posts: 1
Joined: March 24th, 2010
 
 
 

PT11, S1, G2 - A fire chief is determining

by justnomore.3x5s Wed Mar 24, 2010 11:10 pm

I am so turned around on this game. I guess first and foremost, I'm struggling on how to even set this game up. And then of course how to answer questions 7-11.

Any help would be appreciated.
User avatar
 
ManhattanPrepLSAT1
Thanks Received: 1909
Atticus Finch
Atticus Finch
 
Posts: 2851
Joined: October 07th, 2009
 
 
 

Re: PT11, S1, G2 - A fire chief is determing

by ManhattanPrepLSAT1 Thu Mar 25, 2010 4:21 pm

The reason why you're struggling on this game is probably due to the fact that not every firefighter must be scheduled. This creates a lot of uncertainty as you approach the questions. Attached is a slide for the setup.

PT11, S1, G2_AtlasLSAT.pdf
(41.66 KiB) Downloaded 1044 times


Take a look at the setup and see if you can work through the questions using it. The first question is an orientation question, so using the constraints you can eliminate the incorrect answer choices one by one. The rest are conditional questions, so you'll have to take the new piece of information and run with it. See what inferences you can find with each new piece of information given in the question stem.

Here's a big hint. Make sure that you have an understanding of what is possible numerically. Suppose one firefighter is scheduled more than once. Then not every firefighter will be scheduled. If there are three firefighters scheduled, then two of them will be going twice and one of them will be scheduled once. If there are four firefighters scheduled, then one of them will be scheduled twice and three of them will be scheduled once. And so on.

Try and get a handle on this and post your response for what's possible numerically and I'll come back and check to make sure you're on the right track!
 
nnc786
Thanks Received: 0
Forum Guests
 
Posts: 1
Joined: June 01st, 2010
 
 
 

Re: PT11, S1, G2 - A fire chief is determining

by nnc786 Tue Jun 01, 2010 6:52 pm

I'm having a hard time on question 4.

If G does not work during the week, which one of the following statements must be true?
A) F works exactly one day
B) F works exactly two days
C) I works exactly one day
D) I works exactly two days
E) J works exactly one day.

Why is the answer D? Is it because that I is a random?
User avatar
 
ManhattanPrepLSAT1
Thanks Received: 1909
Atticus Finch
Atticus Finch
 
Posts: 2851
Joined: October 07th, 2009
 
 
 

Re: PT11, S1, G2 - A fire chief is determining

by ManhattanPrepLSAT1 Tue Jun 01, 2010 11:58 pm

Attached is a setup for question 11 and an explanation for why answer choice (D) must be true. Let me know if this helps or if you could still use some more help with it.



This one is pretty tricky... The key to these games that have either more characters than spots or more spots than characters is to run the numerical distributions.

If all 5 firefighters work than the numerical distribution would be

1 - 1 - 1 - 1 - 1

But if only 4 firefighters work during the week than it would be

2 - 1 - 1 - 1

And if only 3 firefighters work during the week than it would be

2 - 2 - 1

So, there are three numerical distributions possible...

To help you read the distributions, each digit represents a firefighter and the quantity of each digit represents how many days during the week that firefighter is scheduled.
Attachments
PT11, S1, G2 - Firefighter's Schedules - ManhattanLSAT.pdf
(65.04 KiB) Downloaded 557 times
 
nazu.s.shaikh
Thanks Received: 0
Elle Woods
Elle Woods
 
Posts: 53
Joined: April 27th, 2010
 
 
trophy
First Responder
 

Re: PT11, S1, G2 - A fire chief is determining

by nazu.s.shaikh Tue Jun 29, 2010 11:33 pm

Question regarding the constraints. When a statement ( conditional) says "If H works, then G must work the following day"
in this game are we to considered that if G works does H always have to work the day work? Because as mentioned not every firefighter has to work in a schedule. So if we exclude H from a work week, is it still possible for G to work.
User avatar
 
ManhattanPrepLSAT1
Thanks Received: 1909
Atticus Finch
Atticus Finch
 
Posts: 2851
Joined: October 07th, 2009
 
 
 

Re: PT11, S1, G2 - A fire chief is determining

by ManhattanPrepLSAT1 Wed Jun 30, 2010 2:41 pm

You're on the right track for this game! Once you see how the loss of one player affects who's going to be scheduled at all, this game becomes so much easier.

According to the constraint...

If H is scheduled, then G must be scheduled the day after H.

but if H doesn't work, then G may or not be scheduled that week.

However, if G is not scheduled, then H cannot be scheduled either.

but if G is scheduled, then H may or may not be scheduled.


Let me know if you still need help with this game. It's a tough one, because there's both the in/out aspect to the game and the ordering aspect. Games like this require more flexibility, so you have to be ready to adapt. But like always, if you have an unequal number of players and slots for an ordering game. Always run the numbers!
 
nyno2010
Thanks Received: 0
Forum Guests
 
Posts: 2
Joined: October 24th, 2012
 
 
 

Re: Diagram

by nyno2010 Thu Oct 25, 2012 12:37 am

In the attachment, you say "If G does not work, then from the last constraint H does not work". Where do you get that from? But all we know from the last constraint is G ALWAYS follows H and just because G is not imminent, are you saying that H does not work? Please explain.
 
AliceF488
Thanks Received: 0
Vinny Gambini
Vinny Gambini
 
Posts: 1
Joined: June 07th, 2018
 
 
 

Re: Diagram

by AliceF488 Thu Jun 07, 2018 1:45 pm

According to the rule, if H worked, then G must working in the following day. Q11 said G does not work, if H work, than G have to work, it violate the rule in Q11, so H cannot work in Q11