Logic Grid Puzzles
Read the clues, mark what cannot match, and discover the only possible pairing across every category.
Hints available. Play as many boards as you like.
Ready when you are.
Scan to open on a phone
Scan for the same board — no hints.
How to play
The puzzle describes several people and attributes. Each person matches exactly one item from every category, and every item is used once.
Tap a square to cycle through unknown, yes and no. A confirmed match rules out the other cells in its row and column; negative clues let you place a no directly.
Read all clues as one system. The board is solved when every row and column has one confirmed match and the pairings satisfy every statement.
Strategy
Start with direct negatives and propagate them. If Mina did not choose the comet token, mark that cell no; if comet can then belong to only one remaining person, mark the last cell yes and close its row and column.
Link clues through a shared attribute. If the tea drinker finished before Jules, and the violet-token player drank tea, the violet token also belongs before Jules even though no clue states that pairing directly.
Use the one-left rule whenever a row or column has all but one cell crossed out. Confirming that last cell is safer and faster than rereading every clue for a direct match.
Difficulty and variants
Easy stories use four people and mostly direct clues. Harder grids introduce ordered positions and relational clues, so a fact learned in one category must travel through another before it becomes useful.
Questions, answered
How do you use a logic puzzle grid?
Mark yes where a pair is confirmed and no where it is impossible. Each row and column eventually contains one yes, with every other cell marked no.
Do logic grid puzzles require guessing?
A well-formed puzzle has one solution reachable from the clues. If you feel forced to guess, look for a row with one option left or combine two clues through a shared item.
What is the fastest way to solve a logic grid puzzle?
Enter direct clues first, immediately close the row and column around each confirmed match, then chain relational clues through those fixed pairs.