“A Knight to Remember” is a Murdoku case from the Castle category: a board of 8×8, 7 suspects and one victim. Read the clues, work out where everybody was standing, and name the suspect who was left alone with the body.
The Board
The floor plan as the case hands it to you: 8×8, rated Hard, with 6 rooms. Every person — 8 in all — takes a row and a column of their own.
C1
C2
C3
C4
C5
C6
C7
C8
R1
B
H
Ca
Th
Ca
S
R2
Ch
C
Ch
R3
W
T
C
T
S
S
R4
Su
Su
T
C
T
F
R5
R6
W
Tr
P
H
Ho
R7
Tr
P
P
P
H
Ho
R8
P
Cr
Cr
Tr
Ho
Floor plan of “A Knight to Remember”. Letters mark the objects; the key is below. A thick blue edge marks a window.
Each suspect comes with what the witnesses remember. Read them all before placing anyone — a clue about one person is very often what pins down another.
Alex — a man with a bald head
He was south of at least a woman
Bernd — a man with a bald head and a beard
He was beside a tree. Another suspect was beside the same tree.
Carol — a woman with blond hair
She was north of every suit of armor, in the same room
Dalia — a woman with red hair and glasses
She was on a horse
Elsa — a woman with brown hair
She was alone with a suspect who had black hair
Floyd — a man with red hair, a beard and glasses
In his room there was another suspect in a carriage
Grant — a man with black hair
In his room there was another suspect beside a fireplace
The victim, Viola, is a woman. Nothing else about them is known, and no clue depends on it.
How Hard It Really Is
Deduction steps from the first clue to the verdict
Before anything else, count where each suspect could be if you only read their own clues:
Alex: 43 possible tiles
Bernd: 7 possible tiles
Carol: 2 possible tiles
Dalia: 3 possible tiles
Elsa: 43 possible tiles
Floyd: 11 possible tiles
Grant: 12 possible tiles
The first deductions after that, in the order the solver finds them:
Alex is south of someone with a matching trait – impossible cells removed.
Carol: only row 3 possible – blocked for others.
Bernd & Dalia & Floyd: only rows 6, 7, 8 possible – blocked for others.
That is as far as this page goes. From here on it is yours — the in-game hint giver explains each next step if you get stuck, without giving the answer away.
This case has exactly one solution, and it can be reached by forward deduction alone — no guessing.