Q7

[giladedelman]

7. (D)
Question Type: Unconditional (Orientation)
Orientation questions ask us to choose one possible complete and accurate arrangement of the elements _ in this case, email senders. If you find yourself having trouble with a question of this type, it probably means you haven’t conceptualized the game properly.

Orientation questions can be solved by looking at each constraint, one at a time, and eliminating any answer choice that violates that constraint. Since it’s very rare for more than one answer choice to violate any one constraint, you should move on to the next constraint once you’ve eliminated a choice. (It’s rare, but it does happen occasionally. So if you’re stuck on two choices with an orientation question, go back through the constraints; it’s a safe bet one of them applies twice.)

Let’s start with the first constraint: the first message is not from L. Answer (A) violates that rule, so we can cross it out.

The next constraint tells us that the first and last messages are from the same person. Answer (C) has J first and H last, so we can eliminate it.

The third constraint says we must have the HJ chunk exactly once. Answer (B) is chunkless. Eliminate (B).

The final constraint: J occurs exactly once in the first three positions. Answer (E) begins H, L, L, so we can eliminate it. That leaves us with (D), the correct answer.

[AnnaC659]

Hello there,

I honestly had no idea how to approach this game.
I saw the diagram posted in this folder but I don't understand why HJ chunk is needed.
I probably did not quite understand the question..

The way I understood the rules of this game is:
- Each of the three associates sends minimum of 1 email and maximum of 2 emails.
- Sukanya receives 2 emails at most each day.
- Hence the maximum number of emails S receives is 6, minimum 3.
- First mail is not from Lula (so last cannot be hers either).
- First and last emails are from the same person.
- Exactly one of the first 3 emails is from J.
- Just once, J comes the day after H comes. (since this is about "day," it doesn't seem necessary to be to put them in a chuck as if they should come right next to each other..)

Hence in Q7, I managed to eliminate A, C, and E. But didn't know why B would be wrong.
(B) J, L, H, L, J
If we see this as:
Day 1: J, L; Day 2: H, L; Day 3: J then we still have J sent the day after H was sent!
Also, if we see this as:
Day 1: J; Day 2: L,H; Day 3: L, J then again we still have J!

Can someone please walk me through this? And please tell me what kind of game this is?

[ohthatpatrick]

Hey-o.

For the sort of stuff you were getting into (talking about the setup / the rules / the type), you really want to visit the DIAGRAM thread, not the thread for the first question.

Here's the DIAGRAM thread:
https://www.manhattanprep.com/lsat/foru ... t1212.html

To answer your question, it's a messy Ordering game.

We have an indeterminate amount of spots (as few as 4 and as many as 6),
and we're using our people an indeterminate amount of times (once or twice).

(B) is wrong because it violates rule 3. At no point during (B)'s list is there a message from J the day after one from H.

If you find the wording of that rule confusing, read that linked Diagram thread, where it's discussed a lot.