Run, Don’t Walk, to This Godzilla-Themed LSAT Logic Game

Godzilla opens in theaters today. This dinosaur with human arms has quite the nuanced history. This kind of nuance is the stuff of killer LSAT questions. So, in honor of the masochistic dinosaur fetishists at the LSAC, the LSAT blog brings you an original Godzilla-themed Logic Game, complete with B-movie plot hole!

During seven consecutive days, Godzilla will visit seven cities: Albuquerque, Billings, Chula Vista, Detroit, Erie, Fresno, and Guangzhou. Each city is visited exactly once. During each visit, Godzilla will fight exactly one of her seven enemies: Varan, Oodaku, Rodan, Titanosaurus, King Kong, Mechagodzilla, and Spacegodzilla. The outcome of each fight will be judged a win, or a loss, but not both, for Godzilla. The following is somehow known about Godzilla’s visits and fights:

Godzilla visits Billings and Guangzhou before she visits Albuquerque.
Godzilla visits Fresno, where she loses, after she visits Albuquerque.
Godzilla doesn’t lose any fights after her fifth visit.
Godzilla wins her fourth fight.
Godzilla doesn’t fight Oodaku first or last.
Godzilla fights Mechagodzilla and Spacegodzilla consecutively, winning both fights.*
Godzilla fights King Kong in Chula Vista after her visit to Fresno.
Godzilla fights Rodan second.

* Correction. Sorry everybody.

1. Which one of her nemeses must Godzilla fight after she fights Mechagodzilla?

A. Spacegodzilla
B. Oodaku
C. Rodan
D. Titanosaurus
E. Varan

2. Which one of the following is a complete and accurate list of all the days during which Godzilla can fight Oodaku?

A. 3,4,5,6
B. 4,5,6
C. 2,6
D. 5,6
E. 2,5

3. If Godzilla visits Chula Vista on day 6, which one of her enemies does she have to fight in Fresno?

A. Varan
B. Mechagodzilla
C. Spacegodzilla
D. Rodan
E. Oodaku

4. Which one of the following is the latest day on which Godzilla could visit Albuquerque?

A. 3
B. 4
C. 5
D. 6
E. 7

5. If Godzilla visits Billings third, what’s the maximum number of days that can separate her visits to Chula Vista and Albuquerque?

A. 2
B. 3
C. 4
D. 5
E. 6

1: B; 2: D; 3: E; 4: B; 5: A; 6: C

14 Responses

  1. Crystal says:

    Rawwwwrrrrr!!! I’m ready to destroy a city after destroying that Logic game Godzilla style!
    (disclaimer: not serious about the destroying a city tidbit) haha
    The only one that got me was number 1 cause I forgot that M/S were consecutive fights for a quick minute.. but once I noticed that I saw that it was Oodaku.

  2. Kim says:

    Is there are #6? Also, is it possible to put up an explanation of the answers?

    • Yuko Sin says:

      > Is there a #6?

      That’s ummm one of the plot holes.

      > Also, is it possible to put up an explanation of the answers?

      Here are some keys to this game:

      Combine the first and second rule.
      The third rule means win @ 6 and win @ 7
      Now it looks like Fresno is really restricted, maybe we could place it?

      From there you could do up some scenarios, or at least notice which players have to go to the left of Fresno, and which have to go to the right.

      Hope that helps.

  3. Gerald says:

    Wow, this set up took me a much longer time than expected, but I was able to get it yay! I was worried that the scenario I built would be too empty, but it turned out to be just right for the questions.

    The only point of contention I have with this game is the fact that Godzilla would ever lose. Luckily this isn’t real life; it’s… only a game!

  4. Emily says:

    Is it possible for the MS block to occupy the fifth and sixth?

    • Yuko Sin says:

      Not anymore. I made a hasty edit before submitting the game. I corrected it, it should work fine now. Sorry about that!

  5. Emma Berdugo says:

    I don’t understand #1 but I got all the other ones right. Can someone explain please?

  6. Kim says:

    I’m having some issues with #1 and #5. I followed the rules and made some scenarios. However, I set up 2 scenarios, the first one with S/M in the 3rd and 4th blocks and the second scenario with S/M in the 5th and 6th block. Both allow for placement of O in a spot other than the 1st or 7th and leave room for K in Chula Vista.

    Following those scenarios, the only person that must go after M is K in both scenarios.

    For #5, if Bilings is 3rd, you know Albuquerque is 4th and Fresno 5th. However, that leaves room for Chula Vista in 6th or 7th, meaning that the maximum number of days between Albuquerque and Chula Vista could be 3 days.

    Is there something wrong with my setup?

    • Yuko Sin says:

      Yeah I made a mistake writing one of the rules. Try the game again with the correction. I made a last minute edit before I submitted this game (trying to be more fancy), but I changed it back to what it was originally.


      • Kim says:

        It all makes sense now except for #5. How is the maximum number of days between Chula Vista and Albuquerque 2 days? Given the situation, Albuquerque must be in day 4 and Chula Vista could go as late as Day 7 If you put Chula Vista in Day 7, making the maximum number of days 3 days. Is that incorrect?

        • Yuko Sin says:

          Yeah you got everything right, but you just get to count the days in between: day 5 and day 6. You don’t count day 7, or day 4 since they don’t separate 4 and 7. Does that make sense?

Leave a Reply

Your email will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>