Maze

Mathematical study of mazes viewed as combinatorial structures: enumeration of n×m pseudo-mazes, computation of the maximum number of walls by recurrence, a general formula for the cardinality of the set of pseudo-mazes, and proof of the existence and uniqueness of a path to the exit in a maze. Establishment of necessary and sufficient conditions (number of walls, connectivity) for a pseudo-maze to be a true maze.