Last updated July 07, 2026 · Reviewed by the AnvayaPrep team
Introduction
Grouping Games are the second most common game type in the legacy LSAT Analytical Reasoning section, appearing in approximately 35 percent of all games. These games require distributing or selecting elements from a set into two or more groups (teams, categories, committees, or selections) based on a series of rules. The defining question is membership: which elements belong in which groups?
The 20 topics in this unit cover the complete grouping game system: basic grouping game structure, selection games (choose a subset), assignment games (assign elements to fixed groups), distribution games (divide into groups of specified sizes), in-out grouping (include or exclude), grouping with teams, numerical distribution constraints, conditional grouping rules, rule diagramming for grouping, deduction strategies specific to grouping, template construction, common question types (could be true, must be true, complete and accurate, substitution), and the traps specific to grouping games.
The core competency developed here is conditional constraint management: most grouping rules are conditional ("if X is selected, Y cannot be selected" or "if X is on Team A, Z must also be on Team A"). These rules interact in complex ways, and the deduction process requires systematically applying all conditional implications.
Learning Objectives
- Identify the grouping game type from the scenario and rules: selection (choose a subset), assignment (assign to fixed groups), distribution (divide into groups of specified sizes), or in-out (include or exclude).
- Construct an accurate grouping diagram that represents groups, element counts, and conditional rules.
- Translate conditional grouping rules into standard notation and apply their contrapositives.
- Identify numerical distribution constraints and determine how many elements each group must contain.
- Derive deductions by combining conditional rules: identify forced group placements, identify elements that cannot coexist, and identify elements that must travel together.
- Distinguish complete-and-accurate questions (find a fully valid group assignment) from partial questions (given some placements, determine what else must be true).
- Apply the templates strategy for grouping games with highly restricted numerical distributions or conditional rule interactions.
High-Yield Concepts
| Rule Type | Example | Standard Diagram |
|---|---|---|
| Together rule | X and Y must be in the same group | X <-> Y (same group) |
| Separation rule | X and Y cannot be in the same group | X /same/ Y or X -> not Y |
| Conditional inclusion | If X is selected, Y must be selected | X -> Y |
| Conditional exclusion | If X is selected, Y cannot be selected | X -> not Y |
| At least / at most | Each group must have at least 2 members | Group size constraint |
| Anchor rule | X must be on Team A | X = Team A |
| Either/or | At least one of X and Y must be selected | X or Y (possibly both) |
| Grouping Question Type | Strategy |
|---|---|
| Could be true (valid assignment exists?) | Test whether a specific placement is consistent with all rules |
| Must be true (true in every valid assignment?) | Verify by attempting to violate; if every attempt fails, it must be true |
| Could be false (might not be true in some arrangement?) | Find one valid arrangement where the claim is false |
| Complete and accurate (which list is fully valid?) | Check each rule against each answer; eliminate violations |
| Substitution | Determine what the original rule prohibits; find the answer prohibiting the same set |
For grouping games with many conditional rules, chain the contrapositives carefully. If Rule A says "If X, then Y" and Rule B says "If Y, then Z," the combined deduction is "If X, then Z," and the contrapositive is "If not Z, then not X." Drawing out these chains before questions reveals forced placements that otherwise require repeated reasoning.
Study Strategy
Begin with basic selection and assignment games before studying distribution and in-out games. The more complex game types build on the same conditional rule system; mastering it in simpler contexts first makes the complex types more manageable.
Study numerical distribution carefully. Many grouping games specify how many elements go in each group (e.g., "exactly 3 from Group A, exactly 2 from Group B, exactly 1 from Group C with 6 elements total"). Setting up these constraints as a numerical distribution table before placing individual elements saves time and prevents distribution errors.
Practice the deduction process for conditional rules systematically. For every rule of the form "If X, then Y," immediately write the contrapositive: "If not Y, then not X." For every pair of rules that share a common term (element), combine them to derive new constraints.
Study in-out games as their own subtype. In-out games have only two groups: "in" (selected) and "out" (not selected). Every element must be in one or the other, which creates more powerful deductions because placing an element "out" tells you it is not "in" and vice versa.
Grouping rules are relationships between elements. Like magnetic poles, some elements attract (together rules: they must be in the same group) and some repel (separation rules: they cannot be in the same group). Draw this relationship network before working questions. When you place one element, immediately check who it attracts (must join it) and who it repels (must be separated from it).
Common Mistakes
Ignoring numerical distribution constraints. Many grouping games specify how many elements each group must have. Students who do not track these constraints miss the forced placements that occur when a group is nearly full.
Forgetting to apply contrapositives. If "If X is selected, Y must be selected" is a rule, the contrapositive "If Y is not selected, X must not be selected" is equally valid. Students who only apply the rule in the forward direction miss half the deductions available.
Treating "if" rules as exclusive conditions. A rule like "If X is on Team A, then Y is also on Team A" does not mean Y is on Team A only if X is. Y might be on Team A for other reasons as well. Confusing the conditional with a biconditional is a frequent grouping error.
Misreading either/or rules. "Either X or Y (or both) must be selected" is an inclusive or; at least one of the two must be present. Students sometimes read this as exclusive or (exactly one must be selected), which would prohibit both being selected, an interpretation the rule does not support.
Exam Tips
For grouping games with many conditional rules, draw out the full implication network before starting questions. Each time you place an element, immediately apply the chain of implications and note what additional placements are forced.
For complete-and-accurate questions, check each answer against every rule, not just the rules you remember. One commonly overlooked rule is often what distinguishes the correct answer.
When a question adds a new conditional ("If X is on Team A, which must be true?"), add X to Team A in your diagram, apply all rules triggered by X's placement, propagate all implications, and then answer the question from the resulting state.
Do not assume that elements without explicit rules are unconstrained. Numerical distribution constraints may limit where elements can go even if no specific rule mentions them. If three elements are already assigned to a group that can have at most three members, every other element is constrained to be in a different group even without an explicit rule about them.
Sign up free to keep reading
Create a free AnvayaPrep account to finish this LSAT guide on Grouping Games Legacy — plus flashcards and practice questions.