Haskell, Genetic Algorithm, Graph Theory, Programming.
look like this: Tiles with (potentially) multiple locations per tile At first glance, the analysis for connecting the maze becomes trickier, because the number of vertices in the graph changes! Three of the tiles above have two locations, but the last one has only one. There are even tiles with