The Problem With Traditional Word Searches
A standard word search ends when you find all the words. There is no deduction, no mystery, no conclusion — just a cleared grid. The format is relaxing but passive. You could replace all the words with random ones and the experience would be identical.
Murdsearch Mysteries was designed to fix that. Every letter in the grid is there for a reason, and the letters you do not find are as important as the ones you do.
Two Mechanics, Not One
Murdsearch actually uses two related tricks, not one. First, the word list includes one word that is never placed in the grid at all — that missing word is the murder method, and you identify it by elimination once you're confident every other word has been found. Second, once every word that is in the grid has been found, the grid cells that were never part of any found word are the leftover letters — and those spell out the killer's name and the crime scene, not the method.
How the Leftover Letters Work
When you find every word that is actually in the grid, some cells remain that were never part of any hidden word. These leftover cells are not random — they were placed intentionally to spell out text when read in order: left to right, top to bottom, like reading a page.
That text is the killer's name and the crime scene location. Combine it with the murder method (the one word you could never find) and you have all three answers: killer, method, and location.
Why It Is a Fair Mechanic
Unlike mystery games that hide the answer and reveal it in one dramatic step, this mechanic is fully derivable from the grid and word list you already have. You do not need outside information — if you have genuinely found every in-grid word, the killer and location are sitting in the leftover letters, and the method is the one listed word you were never able to place.
The game does not tell you the answer; it structures how you arrive at it.
A Worked Example (Synthetic — Not a Real Case)
Here is a made-up example to illustrate the idea, not a real Murdsearch case or its answer.
Imagine a small grid where you have found every word in the list except one — "GARROTE" — no matter how carefully you search. That is your murder method candidate, purely because it is the one word you could not locate.
Now imagine the letters left unhighlighted in the grid, read in order, spell out "MRS.VALE" then "STUDY". Combine the three pieces: the method you deduced by elimination (GARROTE), and the killer and location you read from the leftover letters (MRS. VALE, in the STUDY). That combination is what you would submit in the answer boxes.
Real cases work the same way — you just have to do the finding and the reading yourself.