Haskell, Genetic Algorithm, Graph Theory, Programming.
because that’s how many blank tiles came in the box. If I treat each of them as a vertex, then I need 19 connections between them. There’s one further complication. In order for a path to be open, it has to not be blocked on either side, and the outside boundary of the maze is always blocked. So