Recent articles explore formalizations of the popular board game Clue. For several years, this game was used as a testbed for automated theorem proving exercises in the context of introductory and advanced AI classes at the University of Saskatchewan, by way of motivating the usefulness of Prolog Technology Theorem Provers (PTTPS) as game playing engines. Although the game has a simple axiomatization over a small universe, adapting a PTTP to play a full game of Clue is not trivial. This paper illustrates solutions to problems encountered during this exercise, including some interesting computational rules of inference.