Direct elimination (✗)
When a clue says "Lord Blackwood was not in the Library", immediately place an ✗ at the intersection of Blackwood and Library.
Free tool / Logic matrix
The Logic Grid Matrix Solver evaluates a 3-category, 4×4 elimination matrix (4 Suspects × 4 Rooms × 4 Weapons = 48 pairwise intersections) using row-column uniqueness and Boolean transitive closure (for example, confirming Lady Cynthia = Study and Study = Poison automatically deduces Lady Cynthia = Poison). Practice elimination deduction on a 4×4 murder mystery matrix. Click cells to cycle through cross-out (✗), confirmed match (✓), and empty states with automatic cross-elimination.
Deduction principles
When a clue says "Lord Blackwood was not in the Library", immediately place an ✗ at the intersection of Blackwood and Library.
When three out of four cells in a row are marked ✗, the remaining cell must be ✓. Confirming a ✓ eliminates all other cells in that row and column.
If Lady Cynthia is in the Study (✓), and the Study contained the Poison (✓), Lady Cynthia must have held the Poison.
Boolean Matrix Algebra & Worked Example
A k-category, N×N logic grid puzzle consists of k(k − 1)/2 pairwise N×N permutation submatrices (for k = 3 categories of N = 4 items: 3 submatrices of 16 cells = 48 cells total), where each submatrix M^(A,B) is a bijection with exactly one ✓ (1) and N − 1 cross-outs ✗ (0) in every row and column.
For categories Suspects S = {s_1..s_4}, Rooms R = {r_1..r_4}, and Weapons W = {w_1..w_4}, let M(x, y) ∈ {0 (✗), 1 (✓), ?} denote the truth value linking item x and item y:
M(a_i, b_j) = 1 ⇒ ∀ m ≠ j: M(a_i, b_m) = 0 and ∀ n ≠ i: M(a_n, b_j) = 0(∀ m ≠ j: M(a_i, b_m) = 0) ⇒ M(a_i, b_j) = 1M(s_i, r_j) = 1 ∧ M(r_j, w_k) = 1 ⇒ M(s_i, w_k) = 1M(s_i, r_j) = 1 ∧ M(r_j, w_k) = 0 ⇒ M(s_i, w_k) = 0Using the trainer’s 4 Suspects (Lord Blackwood, Lady Cynthia, Professor Vance, Dr. Sterling), 4 Rooms (Library, Study, Dining Room, Conservatory), and 4 Weapons (Dagger, Poison, Revolver, Rope), consider these 5 clues:
M(Lady Cynthia, Study) = ✓; auto-eliminate Library, Dining Room, and Conservatory for Lady Cynthia (3 ✗), and eliminate Study for Blackwood, Vance, and Sterling (3 ✗).M(Study, Poison) = ✓; by positive transitivity (Cynthia = Study ∧ Study = Poison), the solver automatically marks M(Lady Cynthia, Poison) = ✓.M(Lord Blackwood, Conservatory) = ✓.M(Professor Vance, Library) = ✓ and M(Professor Vance, Dagger) = ✓, which by transitivity sets M(Library, Dagger) = ✓ and leaves M(Dr. Sterling, Dining Room) = ✓ as the last remaining room.M(Lord Blackwood, Revolver) = ✓ and M(Dr. Sterling, Rope) = ✓ complete all 48 cells.| Suspect (Category 1) | Library | Study | Dining Room | Conservatory | Matched Room | Matched Weapon | Key Deduction Rule Used |
|---|---|---|---|---|---|---|---|
| Lord Blackwood | ✗ (0) | ✗ (0) | ✗ (0) | ✓ (1) | Conservatory | Revolver | 3 room eliminations → forced 4th room + weapon exclusion |
| Lady Cynthia | ✗ (0) | ✓ (1) | ✗ (0) | ✗ (0) | Study | Poison | Direct match + positive transitive link (Study = Poison) |
| Professor Vance | ✓ (1) | ✗ (0) | ✗ (0) | ✗ (0) | Library | Dagger | Direct suspect-room and suspect-weapon conjunction |
| Dr. Sterling | ✗ (0) | ✗ (0) | ✓ (1) | ✗ (0) | Dining Room | Rope | Last remaining column/row bijection in both subgrids |