One solution is only the first check.

One solution

Every core Verdict case is accepted only when an exact solver finds exactly one solution. A puzzle with multiple valid arrangements is not a finished case.

The generator starts from a complete arrangement and builds clues that agree with it. As clues are removed, the exact solver counts possible solutions, stopping once it finds a second one.

This is a property of the puzzle, not a solving instruction. An exact solver can explore alternatives internally to prove uniqueness. That alone does not establish a deduction path for the player.

No guessing path

The same core case must also be completed by Verdict's technique solver without a guess. It applies deductions from the clues and the grid rules until the board is complete.

If that solver cannot complete the board, the generator rejects the candidate and tries again. Difficulty comes from the techniques used, rather than how long the computer took. These checks describe the core logic-grid generator; other Verdict modes use their own rules.

A deduction in miniature

Suppose a three-room exercise says Ava carries the key, Ava is in room two, and the tea is immediately before the key. The key must be in room two, so the tea must be in room one. This follows from the clues without trying a placement and waiting for feedback.

This illustrates one deduction, not a complete published case. A screened path does not mean each step will be obvious to every player, or that there is only one order in which to solve the case.

What that means for players

If you are stuck, look for a placement a clue forces, then rule that value out everywhere else. The field manual walks through the process with a small example.

The word “human” in a technique solver describes its rule set. It does not mean every generated case was manually playtested by a person. If a case appears contradictory, report its date and difficulty through support so we can investigate.