Finite Linear Games: Exploring Math Behind Puzzles

This talk explores using matrix algebra techniques to solve modulo restricted finite linear games. All finite linear games possess a definite number of game states; the state changes are predictable, tied to specific actions, and obey the commutative law. Solving these puzzles with a structured approach will ensure a solution is found, so long as one exists, and is more reliable than haphazard guesswork. The importance of proper identification and translation of a puzzle’s mechanics into the matrix algebra space is also briefly discussed.