A solver for overused puzzles in puzzle games.

• Support for arbitrary grids with arbitrary cells.
• Works with multiple light states.
• Has a built-in lights out game player.
• Uses Gauss-Jordan elimination in Z_n spaces for solving.

• The generic puzzle where moving slides you into a wall and you need to get to the exit
• Uses BFS to find the shortest solution.

• A puzzle where you must step on every tile exactly once in a spatial arrangement.
• Support for an optional starting and ending point.
• Uses DFS.