Mystery Master

Laws

Michael Benson


Judge

Introduction

Hello, I am an Artificial Linguistics Nanobot... but you can call me Alan. My objective is to give a general description of the Laws in the Mystery Master application.

In any civilized society, people follow the "Rule of Law", though sometimes you humans devolve into the "Law of the Jungle". But I digress...

In the early milliseconds of my education, I was taught the "Three Laws of Robotics", created by Isaac Asimov. These laws govern my interactions with humans, though sometimes my programming... befuddles me.

The Mystery Master follows a set of laws as well. When a mark is entered, the laws are applied to that current mark to see if additional marks can be entered. These additional marks are called postmarks. To avoid overloading primitive brains, let's say the two nouns in the current mark are noun 1 of type 1, and noun 2 of type 2. The laws are given below.


Lawbook

Law 1 - Fundamental Law of Logic Grid Puzzles

This law ensures that a noun of type 1 is with exactly one noun of type 2. If noun 1 is with noun 2, then their intersecting cell in the grids has the 'O' character. In the subgrid for nouns of type 1 and type 2, this law fills the other cells in that row and column with the 'X' character. This means that for every subgrid, there will be exactly one positive mark per row, and exactly one positive mark per column.

Law 2 - Transposition of Marks

This law requires at least three noun types. Based on the current mark's verb, it examines prior marks to determine if a noun of type 3 is or is not with a noun of the mark.

Law 3 - Common Nouns of Type 3

This law requires at least three noun types, and is applied only when noun 1 is not with noun 2. It determines if a noun of the mark and a noun of type 3 have any nouns in common. If they do not share at least one common noun, then they cannot be together.

Swift Justice

Law 4 - Reservations for n Nouns

This law is implemented for only n = 2. It looks for the following condition: if two nouns of type 1 can only be with two nouns of type 2, then no other nouns of type 1 can be with those same two nouns of type 2. In other words, those two nouns of type 2 are reserved for the two nouns of type 1.

Law 5 - Referential Facts

This law requires at least three noun types. Because it examines each fact to see if it references a noun in the mark, this law overlaps levels 1 and 2. When this law is enabled, most puzzles can be solved by level 1.

Conclusion

I hope you now have a greater appreciation of the laws and how they can help solve a logic puzzle. Remember what Michael Benson, the self-proclaimed "Logic Puzzler" and plagiarizing mangler of the rock band Sweet, once said: "Laws are like oxygen; not enough and you're gonna die."