Clues by Sam helper
Prove criminal or innocent statuses from the revealed logical clues.
Your puzzle
A little help
Enter your puzzle or try the original example. You choose when to open candidates, explanations and complete results.
How the Clues by Sam helper works
- Every person is criminal or innocent, and everyone tells the truth.
- Neighbors include diagonals; connected means orthogonally linked. A connected group must contain at least one person.
- Numbers are exact unless the clue explicitly gives a comparison.
Prove criminal or innocent statuses from the revealed logical clues. Work from the information you have already revealed; this helper does not fetch an official daily answer.
Results use the puzzle you enter; they are not verified daily answers. Your entries stay out of public URLs.
A worked deduction
In the original example, exactly one of A1 and B1 is criminal. B1 is confirmed innocent, so A1 is criminal. A1 and C1 differ, so C1 is innocent. The engine verifies both conclusions by testing their opposites.
Count and group grammar
COUNT criminal row:1 = 2; COUNT innocent col:A >= 1; COUNT criminal profession:cook > COUNT criminal profession:artist. Use =, !=, <, <=, > or >=. Comma-separated groups are unions without double-counting. Multiword professions can use underscores in both people and selectors.
Precisely choose the people
Selectors: A1, row:1, col:A, profession:cook, all, neighbors:A1, common:A1:B2, between:A1:D1, above:A3, below:A1, left:D1, right:A1, directabove:A2, directbelow:A1, directleft:B1, directright:A1. Between excludes endpoints. Common means intersection of both neighbor sets.
Other supported clue forms
PARITY criminal neighbors:A1 odd (or even); SAME A1 B2; DIFFERENT A1 B2; criminal:A1; innocent:B2; CONNECTED criminal row:1. IF criminal:A1 THEN innocent:B2 is one-way. IFF criminal:A1 THEN innocent:B2 also asserts the reverse. An empty connected group is invalid, while one person is connected.
Read the proof scope
Only confirmed statuses and entered clauses are used. A complete possible assignment is kept separately from deductions: one arrangement is not evidence that every unknown has been solved. A capped search can miss deductions but cannot turn an unproved guess into a forced move.
Supported puzzle types
- player-entered state
Scope of this helper
- Up to 25 entered people and 80 explicit clues. No guessing from profession or hidden clues.
- Search is bounded; only an exhaustively disproved counterfactual can support a reported deduction.
- Unsupported natural-language constructions must be translated explicitly; they are never silently guessed.
Play the original at Ad Artis Oy. This is an unofficial helper with no publisher affiliation.
Rules and reference sources
- Official rules and clarifying details — checked 2026-10-04
Choose another game · Find daily hints and archives · Report a problem