Detective Di: The Silk Rose Murders is a Kickstarter-backed point-and-click adventure game. After reaching its funding target in March 2015, the game was finally released in May 2019.
Unusually for me, I picked up a copy almost immediately after release. It was on offer on Steam and looked interesting, with the promise of a detective adventure requiring the player to deduce the identity of the killer.
I didn’t get what I was promised, the deduction mechanic obviously being shaved down to almost nothing over the 5-year production cycle. But Detective Di is an otherwise well-polished game, with engaging story and characters, and a few interesting puzzles to while away a couple of long evenings. Overall: 3 out of 5.
Shame on me for failing to post anything for over a year. I’ve been working on some puzzles and ideas of my own, but have nothing to reveal yet. As part of that work, I’ve been expanding my knowledge of Puzzle Dependency Charts so will instead share some information about them, including two full charts for LucasArts flawed masterpiece, The Dig.
Puzzle Dependency Charts (or Graphs, or Diagrams) are an excellent tool for designing and refining interconnected puzzles. Online discussions usually focus on their use in the classic LucasArts adventure games since Ron Gilbert of Monkey Island fame developed them to help design his games. But they are not limited to computer games and would be helpful for designing physical Escape Rooms or any multi-stage puzzle.