- Mon Nov 07, 2022 8:15 pm
#98159
Hi nstiell!
The short answer to your question is yes. It'd take too long to diagram out every answer choice for every question. If the test were untimed, this would probably be a great aid in figuring out the correct answers. But given the time constraint, a more feasible goal is to diagram out only whichever answer choices you've narrowed down as contenders.
This question in particular is a could be true question. There are some general strategies that one can think about on this type. An initial instinct that is often helpful upon seeing this question type on a game is to look for a random variable--given its nature as a random, that type of variable often will come into play on a could be true question. In this game, however, there aren't any random variables.
Beyond looking for randoms, another strategy is to look for variables with lots of constraints attached to them. Since one answer choice could be true, this means is that four of the answer choices cannot be true. In this game, H, S, M, and V are variables with more constraints (these occur in 2 rules) than others (L and T only occur in one rule). This isn't a huge difference so might not help narrow down answer choices. Related to this, one can also look for specific slots (here, the base is days from June 1st through June 6th) that are more constrained or more open than others. In this game, for example, S, M, and V cannot be on the first, so it must instead be H, L, or T.
Finally, those are suggestions more in the abstract about how to narrow down the answer choices to contenders on a could be true question, but part of why they don't necessarily get to the right one on their own in this game is because of the conditional, contingent reasoning in the game's 2nd and 4th rules. It's not necessarily possible to determine what could be true in the abstract, without seeing how those rule can or cannot play out. Here, with S and V on the 2nd and 3rd as in answer choice (B), we can start with knowing that the 1st must be H/L/T. If H is 1st, though, then this violates the 4th rule, so H is out. T also couldn't be 1st--if we started with T, S, V, this would violate the 4th rule. But L could work in the 1st spot. If L is 1st, we could have: L, S, V, T, H, M, or L, S, V, T, M, H, or L, S, V, M, T, H.