LSAT 28, Game 4 Setup, Town Councillors, LSATHacks

LG Game 4 Setup, by LSATHacks

Game Setup

This is a grouping game. We have to see who votes for and against each bill. We can set up the councilors this way:

They each have three spots: one for each bill. Everybody votes for something and against something.

Two people vote for recreation. Gianola votes against recreation. That means both Fu and Herstein vote for it.

We also know that Fu is against schools and Herstein is against taxes.

That’s all we know for certain. I’ve drawn a diagram that shows this. The Rs are circled because they have to be voted for. The rest of the variables have lines though them to show they’re voted against.

I should note that this is not the only way this can be diagrammed. There are many other ways of showing this that make sense. If you’ve drawn in a different way, that isn’t a problem. This is a fairly unique game. It doesn’t really matter how you draw unique games as long as it’s logically consistent and makes sense to you.

It’s only for the rules that repeat frequently that you want a fairly standardized method that is as clear and efficient as possible.

We know that only one person votes for the school bill and one for the tax bill, so two vote against each. We already know that F voted against the school bill and R votes against the tax bill.

So one of F or G votes for the tax bill and one against it.

One of G and H votes for the school bill and one against it.

I drew a box around those to show that one is for and one is against.

In local diagram, when we’re sure someone is voting for taxes or schools, I switch the box to a circle.