LSAT Logic Games Could Be True Questions

Mastering could be true questions is essential for speed and accuracy in the Logic Games section. These questions test your ability to identify possibilities within a constrained system, and a systematic approach to them can save precious minutes and mental energy for the entire section. Unlike questions that demand certainty, these require flexible, probabilistic thinking.

Defining "Could Be True" and Its Strategic Importance

A could be true question asks you to select the one answer choice that represents a possible arrangement or outcome given the game’s rules and conditions. The four incorrect answers will all be impossible—they violate rules or contradict a condition established in the question stem itself. Understanding this transforms your task from "proving something right" to "disproving four things wrong." This mindset is your most powerful tool. In the context of the LSAT, these questions often appear in the middle of a game, serving as a bridge between initial setup and more complex conditional questions. Efficiently answering them often provides a valuable template arrangement you can reuse for subsequent questions.

The Systematic Elimination Strategy

Your primary weapon for these questions is process-of-elimination. You must check each answer choice against the game’s rules and any new condition introduced in the question stem. The goal is to find the fatal flaw that makes an arrangement impossible. For example, if a rule states "A is before B," and an answer choice shows B before A, you eliminate it immediately. Work through the choices methodically. Often, two or three answers will contain obvious violations of the core rules. The remaining one or two choices require a slightly deeper check, but the field has been narrowed significantly. This systematic approach prevents you from jumping to test the first answer that "looks" possible and potentially wasting time.

Leveraging Previous Work and Templates

One of the most efficient strategies for could be true questions is to use previous work from other questions. If you have already drawn a possible scenario or template while solving a prior question in the same game, compare the answer choices against it. An answer choice that matches your known-valid template is almost certainly correct, allowing you to answer in seconds. Even if the templates don’t match exactly, they inform you about what can happen. This technique highlights why it’s crucial to note your work on the scratch paper—a diagram from a "must be true" question can directly answer a later "could be true" one, giving you a significant time advantage.

Efficiently Testing the Remaining Choices

After initial elimination, you may be left with two contenders. Now you must test remaining choices quickly. Do not attempt to build a full, perfect diagram from scratch for each one. Instead, try to plug the choice into your existing framework. See if you can make it work with minimal adjustment. Look for the most restrictive element in the proposed arrangement and see if you can satisfy all rules relative to it. If you hit a contradiction, eliminate it. If you can sketch a rough, rule-compliant scenario that incorporates the choice, you’ve found your answer. This testing should be agile, not meticulous; you are looking for a possibility, not the only possibility.

Contrasting with "Must Be True" Questions

A critical part of your analytical toolkit is understanding how could be true questions contrast with must be true questions. They require diametrically opposed reasoning. A "must be true" answer is something that happens in every valid scenario; to disprove it, you only need to find one scenario where it is false. Conversely, a "could be true" answer only needs to happen in one valid scenario; to disprove it, you must prove it is impossible in all scenarios. Confusing these approaches is a common trap. For a "could be true" choice, you are not asking, "Is this always true?" You are asking, "Is this ever possible?" This shift from universal to existential quantification is the core conceptual difference.

Common Pitfalls

1. Proving the Answer Choice Instead of Disproving the Others: The biggest mistake is trying to definitively prove that (C) "could be true" by building a complete diagram, while ignoring that (A), (B), (D), and (E) are impossible. This wastes time. Your job is to be an eliminator. Find the four wrong answers; the one left is right by default.

2. Ignoring the Question Stem's New Condition: Many "could be true" questions add a conditional statement like, "If K is in spot 3, which of the following could be true?" Test-takers sometimes apply the core game rules but forget to apply this new "if" condition to every answer choice, leading them to select an answer that violates the temporary premise.

3. Over-Diagramming During Testing: When you have two plausible answers, avoid the urge to draw two perfectly neat, complete diagrams. Make quick, messy sketches. Use arrows, place the most fixed elements, and check for rule violations. The moment you see a viable path for one choice, select it and move on.

4. Misapplying "Must Be True" Logic: As noted, if you mistakenly look for an answer that must be true, you will often eliminate the correct "could be true" answer because it isn't necessary in all worlds. Remember the fundamental question: "Is there at least one world where this happens?"

Summary

• Could be true questions ask you to identify the one answer choice that is possible within the game's rules, making elimination your core strategy.
• Always eliminate answers that violate rules first, then test any remaining contenders with quick, flexible sketches.
• Use previous work from other questions as a potential shortcut; a valid diagram from another question can instantly validate a "could be true" answer.
• Test remaining choices quickly by integrating them into your framework, not by building exhaustive new diagrams from scratch.
• Crucially, contrast these with must be true questions; "could be true" requires finding a single valid instance, while "must be true" requires a universally valid inference.
• Avoid the trap of trying to prove the correct choice and instead focus on disqualifying the four incorrect ones through systematic rule-checking.