Some Game cheat sheets reposted

arabprodigy30

Hey guys, I dug these up in the older posts. Just wanted to repost if anyone needs them
Edit: These notes belong to @emli1000! Thanks!


INTRODUCTION TO GROUPING GAMES: THE IN-OUT GAMES
CONDITIONAL RULES TRIGGER V. IRRELEVANT Lesson 1 of 27

• Sufficient satisfied: Rule triggers, necessary must be satisfied.
J→ F
Jl
------------
Fl
• Sufficient failed: Rule irrelevant, necessary free to satisfy or fail.
J→F
/JA
-------
YOU CAN STILL INVITE F
• Necessary failed: Rule triggers, sufficient must be failed.
J→F
/FA
-----------
/JA
• Necessary satisfied: Rule irrelevant, sufficient free to satisfy or fail.
J → F
FA
-----
*YOU CANNOT SAY IF ALLY IS FREE TO BE A F USER OR A J

“NOT BOTH” V. “OR” TRUTH TABLES LESSON 5 OF 27
NOT BOTH:
• SC = POSITIVE
• MAX = 1, MIN= 0

OR:
• SC= NEGATIVE
• MAX=2, MIN=1


HOW TO QUICKLY REACT TO LOGIC GAMES QUESTIONS STEM FLASHCARDS Lesson 13 of 24

1. Must be true / CANNOT be false
This type of question asks you to select the answer choice that must be true. In other words, the correct answer choice CANNOT be false. The four incorrect answers all could be false.
2. Must be false / CANNOT be true
This type of question asks you to select the answer choice that must be false. In other words, the correct answer choice CANNOT be true. The four incorrect answers all could be true.
3. Could be true
This type of question asks you to select the answer choice that could be true. The four incorrect answers all must be false or CANNOT be true.
4. Could be false
This type of question asks you to select the answer choice that could be false. The four incorrect answers all must be true or CANNOT be false.

Hint: switch “must” with “could” and “true” with “false”.

ADVANCED LOGIC- GAMES
ADVANCED: “AND/OR” IN SUFFICIENT CONDITIONS Lesson 2 of 15
SPLIT: OR IN SUFFICIENT
DON’T SPLIT: AND IN SUFFICIENT

• And/or in the SC
• IF Esmeralda OR James teaches the class, THEN Jenny will pay attention
o E or J → PA
Independent sufficient OR (SPLITS)
o E→
o PA
o J→
• IF Esmeralda AND James teaches the class, then Jenny will pay attention
o E and J → PA
o Jointly sufficient for this since it uses AND

ADVANCED: “AND/OR” IN NECCESSARY CONDITIONS Lesson 3 of 15
SPLIT: AND IN NECCESSARY
DON’T SPLIT: OR IN NECCESSARY

• IF Simmi takes American Pop Culture, then James OR Andrew will also take the class.
o S→ J or A
• IF Simmi takes American Pop Culture, then James AND Andrew will also take the class.
S→ J and A (SPLIT)
S→J
S→A

CONTRAPOSITIVES: DEMORGAN’S LAW Lesson 4 of 14
. and becomes or, vice versa
2. negate both elements
• If Tome plays, Then Jerone and Simmi play too.
T→ J and S
/J and /S → /T
= /J OR /S → T
• IF JENNY OR ANDRE SINGS, HEN JULIAN AND ESMERALD SING TOO.
JY OR A → JU AND E
[NOT] JU AND E]
=/JU OR /E → /JY AND /A

CONTRAPOSITIVES: DEMORGAN’S LAW THEORY Lesson 5 of 14


• IF JENNY OR ANDRE SINGS, HEN JULIAN AND ESMERALD SING TOO.


ADVANCED: BI-CONDITIONAL Lesson 7 of 15
• 2 Types
1. Always together, never apart
2. Always apart, never together

• English- indicate that you are reading a bi-conditional
1. (Either) or, but not both
2. If and/but only if

3. … But not otherwise

o EX: Alan(A) attends the meeting if but only if Chris(C) attends the meeting.
o A←→C
o What does this statement mean in English?
-Alan attends the meeting if Chris attends the meeting. (C→A)
And/But (mean the same thing)
-Alan attends the meeting only if Chris attends the meeting. (A→C)
C→A and A→C
= A←→C … Contrapositive is /A←→/C

4. Except
• Mastery
o Embedded Conditionals
• Contrapositive

OR, BUT NOT BOTH Lesson 8 of 15


1. (Either) or, but not both
o EX: Alan (A) or Chris(C) goes to the park, but not both.
o Alan or Chris goes to the park – [/A→C contrapositive /C→A]
o and and
o Alan and Christ cannot both go to the park. [A→/C contrapositive C→/A]
o /A←→C
o A←→/C

BUT NOT OTHERWISE Lesson 9 of 15
• EX: Alan goes to the park if Chris goes to the park, but not otherwise.

If Chris goes to the park, then Alan goes to the park [C→A contra. /A→/C] And/but
If Chris does not go to the park, then Alan does not go to the park.
[/C→A contra. A→C]
COMBINED: A ←→C contra: /A←→/C

EXCEPT Lesson 10 of 15
• Not all that important in a Logic Game. Hardly seen as in indicator
• EX: Alan goes to the park everyday, except the days on which Chris goes to the park.
o A→/C contra C→A
o /C →A contra /A→C
o COMBINED: A←→ /C contra /A ←→C

TWO TYPES OF BICONDITIONALS Lesson 11 of 15
1. Always, Together, Never apart
A ←→B – [always go to the park together]
/A←→/B – [Always together NOT at the park. They always stay home together]
LR: realize the distinguishION between the two have clasped.
2. Always Apart, Never Together
/A←→B [Alan does not go to park, Chris goes to the park]
A←→/B [Alan park, Chris stays home]

***NOTE: ONCE = IF= SC ***

MASTERY: EMBEDDED CONDITIONAL Lesson 13 of 15
• If, then, unless
• EX: If [the seeds are planted in the winter,] then [flowers will not blossom unless fertilizer is applied.]
/FB unless FA
/FA→ /FB contra FB→FA
• COMBINED: SPW→(/FA→/FB)
• WHAT THIS STATEMENT REALLY MEANS:
SPW AND /FA→/FB
OR
SPW→(FB→FA)
SPW AND FB→FA

MASTERY: EMBEDDED CONDITIONAL PROOF Lesson 14 of 15
SPW→(FB→FA)
SPW AND FB→FA
Ex: PROOF:
A→ (B→C)
/A or (B→C)
/A or (/B or /C)
(/A or /B) or C
NOT [/A or /B] →C
A and B →C

LAWGIC REVISTED Lesson 15 of 15
• Rule: 1. Move Sufficient out
2. Change arrow to AND
• Revisited: Translation Across English Construction

• Revisited: Element of Lawgic
1). → = arrow, implies
2). / = not, contradiction, negate
3). And = and
4). or = or
5). ←→ = biconditional
6). A, B, C, etc. = symbols







>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

For in/out games, I tend to look for something along the lines of, "Each does exactly one of two things" or "out of x# of people, x# will be selected." For in/out games that have groups on the in or the out side, I usually notice that the pieces are split up before the rules by type. For example, "From 6 scientists, 2 Mad Scientists, 2 Crazy Scientists, and 2 Rogue Scientists, x# will be selected." In these cases, one of the rules will usually create a limit on the # of a particular type that can/can't be selected (at most 1 Mad Scientist can be selected if blahblah).

For chart games, I look for two sets of things with a binary switch for one set of things or the other. An example would be, x# car models/vacation packages/LSAT prep companies each have the possibility of these x# of features .... So you have x# things to which x# of other things either can or cannot apply. The either/or is your binary, your on/off switch and it goes in the middle, while the features and the things to which those features apply go on the outside edges. The cars with leather or sunroof was a good game to learn to recognize chart language.

Simple Grouping Games are a lot like the more complex chart games, but minus the binary switch. Instead of having 3 Council members vote yes/no (that's your binary) on 4 bills, you'd just have 3 Council members must vote on at least x# of bills. The game doesn't care how they vote (or in the abstract, doesn't care about the result of the binary switch).

For sequencing games, I notice lots of ordering words in the rules. For example, anytime I see X must be before Y but after Z, I assume sequencing and set it up as a simple sequencing game. If another rule adds another thing/descriptor that you have to tack on to each thing, then it becomes a double/multi-layer sequencing game - same setup, just add another row on top/bottom.

harrismegan

Nice

arabprodigy30

Please add more to it if you have anything else

emli1000

Hey these are my notes. I've emailed them to a couple of people on here LOL

merilys1

Thank You for sharing:)

arabprodigy30

@emil1000 sorry I did not know, I just found it on thread and posted it again for everyone to take thank you for your notes! they are so helpful

emli1000

No need to apologize lol. Thanks! Im just glad ppl are using them.

Alexandra3-2

Thank you so much! These notes are so helpful.