LSAT—India Analytical Reasoning (Logic Games) Syllabus

Analytical Reasoning (Logic Games) syllabus — full chapter and topic list

Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Analytical Reasoning (Logic Games) in LSAT—India, not a summary of it.

1. 1

   Foundations of Analytical Reasoning

   4 topics

   • Anatomy of a Game
     • Setup, entities, and conditions
     • The question stem and answer choices
     • How AR differs from Logical Reasoning
   • Reading the Stimulus Accurately
     • Fixed vs. floating entities
     • Spotting numerical distributions
   • Diagramming Fundamentals
     • Slots, columns, and master sketches
     • Notation shorthand and symbols
   • Time Management Per Game
     • Allocating roughly 8-9 minutes per game
     • When to skip and return
2. 2

   Conditional Logic and Inferences

   5 topics

   • Sufficient and Necessary Conditions
     • Identifying triggers and results
     • Conditional indicator words
   • The Contrapositive
     • Negating and reversing terms
     • Chaining contrapositives
   • Conditional Chains and Linking Rules
     • Combining multiple conditionals
     • Detecting forced placements
   • "Unless," "Until," "Without" Constructions
   • Biconditional and "If and Only If" Rules
3. 3

   Sequencing (Ordering) Games

   5 topics

   • Linear Sequencing
     • Single-row ordering setups
     • Relative vs. fixed positions
   • Block and Anti-Block Rules
     • Adjacent and non-adjacent pairs
     • Spacing and gap rules
   • Tree (Branching) Diagrams for Relative Order
   • Double-Layer and Stacked Sequencing
   • Circular and Looped Arrangements
4. 4

   Grouping and Distribution Games

   4 topics

   • In/Out (Selection) Games
     • Two-group binary selection
     • Conditional selection chains
   • Distribution into Multiple Groups
     • Fixed vs. variable group sizes
     • Minimum and maximum constraints
   • Matching and Assignment Games
   • Numerical Distribution Analysis
     • Determining possible splits
     • Forced distributions from rules
5. 5

   Hybrid and Advanced Games

   4 topics

   • Combined Sequencing-Grouping Games
   • Pattern and Process Games
   • Mapping and Spatial Games
   • Games with Unusual or Open Rules
     • Rule substitution questions
     • Limited-information setups
6. 6

   Question Types and Solving Techniques

   6 topics

   • Must Be True / Could Be True Questions
   • Could Be / Must Be False Questions
   • Acceptability (List) Questions
     • Eliminating answers rule by rule
   • Maximum / Minimum and Completely Determined Questions
   • Rule Substitution and Equivalent Rule Questions
   • Hypotheticals and Templating Strategy
     • Splitting a game into limited scenarios
     • Identifying key restricted entities

Analytical Reasoning (Logic Games) flashcards for LSAT—India

23 of 50 cards from the Analytical Reasoning (Logic Games) deck — real questions with worked answers.

1. What are the four main structural components you should identify in the 'anatomy' of a logic game?

   (1) The scenario/setup (what is being arranged), (2) the variables/players being placed, (3) the rules/constraints governing placement, and (4) the questions asked about valid arrangements.

2. In a logic game stimulus, why is reading the setup precisely (e.g., 'exactly,' 'at least,' 'at most') critical before diagramming?

   These quantity words define the base and how many slots/variables exist; misreading them (e.g., treating 'at least one' as 'exactly one') corrupts the entire diagram and every inference drawn from it.

3. What is the standard recommended time budget per game on the LSAT-style Analytical Reasoning section?

   About 8 minutes and 45 seconds per game (35 minutes divided among 4 games), so roughly 8 to 9 minutes each, including setup, deductions, and all questions.

4. Define a 'sufficient condition' in conditional logic.

   A sufficient condition is one whose occurrence guarantees the result; if the sufficient condition is met, the necessary condition must follow (it appears on the left side of an arrow: Sufficient -> Necessary).

5. Define a 'necessary condition' in conditional logic.

   A necessary condition is one that must be true for the sufficient condition to hold; it is required but does not by itself guarantee the sufficient condition (it appears on the right side: Sufficient -> Necessary).

6. How do you form the contrapositive of the statement 'If A then B' (A -> B)?

   Negate both terms and reverse them: 'If not B then not A' (~B -> ~A). The contrapositive is logically equivalent to the original statement.

7. Why are the converse and inverse of a conditional NOT logically valid inferences?

   The converse (B -> A) and inverse (~A -> ~B) reverse or negate only one part of the relationship without doing both, so they do not preserve truth; only the contrapositive (negate AND reverse) is equivalent.

8. How do you translate the construction 'A unless B' into a conditional statement?

   Treat 'unless' (also 'until,' 'without,' 'except') as 'if not': the term after 'unless' becomes the negated sufficient condition. 'A unless B' becomes ~B -> A (equivalently ~A -> B).

9. Using the Unless Equation, how do you diagram 'Maria attends unless it rains'?

   Negate the 'unless' clause (rain) and make it sufficient: 'If it does NOT rain, Maria attends' (~Rain -> Maria). Equivalently, if Maria does not attend, it rained (~Maria -> Rain).

10. What does a biconditional ('A if and only if B') mean, and how is it diagrammed?

    It means both A -> B and B -> A hold simultaneously: A and B always have the same status. Diagram as A <-> B; either both occur together or both are absent together.

11. In a conditional chain like A -> B -> C, what valid inference can you draw, and what is its contrapositive?

    You can link to get A -> C (transitivity). Its contrapositive is ~C -> ~A; the full reversed chain is ~C -> ~B -> ~A.

12. What is the proper way to link two rules into a conditional chain?

    Connect them only where the necessary condition of one rule is identical to the sufficient condition of another (the matching variable in the same form/polarity), then chain through that shared term.

13. What defines a Linear (basic ordering) sequencing game?

    Variables are placed into a fixed number of ordered, distinct positions (e.g., 1st through 7th) with each position typically holding exactly one variable; the base is the ordered slots.

14. What is a 'block' rule and how is it diagrammed?

    A block requires two (or more) variables to be adjacent or in a fixed relative arrangement, e.g., [AB] means A immediately before B; [A/B] vertical block means they share the same position/column in stacked games.

15. What is an 'anti-block' (not-block) rule and how is it shown?

    An anti-block forbids two variables from being adjacent or together. Diagram as a block with a slash through it (e.g., [AB] crossed out), meaning A and B cannot occupy consecutive positions.

16. When should you use a tree (branching) diagram instead of a standard linear setup?

    Use a tree/branching diagram for pure relative-ordering games where rules give only relative order (e.g., 'A before B,' 'C before D') without fixed numbered positions.

17. In a relative-ordering tree diagram, how do you read 'A is before B' and 'A is before C'?

    Draw A with two branches pointing to B and C, showing A precedes both, while B and C have no fixed order relative to each other unless another rule connects them.

18. What characterizes a double-layer (stacked) sequencing game?

    Each ordered position holds two or more attributes/rows (e.g., a person AND their assigned color per slot), so you build a grid with multiple stacked rows over the same ordered base.

19. What is unique about diagramming a circular (looped) arrangement game?

    Positions form a closed loop with no fixed start/end, so 'adjacency' wraps around (first and last positions are neighbors). You usually fix one variable to anchor rotations and treat seats as relative.

20. What defines an In/Out (Selection) game?

    A pool of variables is divided into two groups: selected (in) and not selected (out). Rules are mostly conditional, governing which variables can or must be in or out together.

21. In selection games, what does the rule 'If A is selected, B is not' (A -> ~B) tell you about the contrapositive?

    Contrapositive: 'If B is selected, A is not' (B -> ~A). A and B can never both be in; at most one of them is selected.

22. What distinguishes a Distribution (grouping) game from a selection game?

    In distribution games every variable must be placed into one of several defined groups (no 'out' pile typically), and you often track how many go into each group.

23. What is a Matching (assignment) game?

    A game where variables are matched with one or more attributes/characteristics (e.g., each person assigned a day and a color), often allowing attributes to repeat across variables.

See more Analytical Reasoning (Logic Games) flashcards →

Planning Analytical Reasoning (Logic Games) for LSAT—India

Analytical Reasoning (Logic Games) (LSAT—India) FAQ