Haskell, Genetic Algorithm, Graph Theory, Programming.
bunch of locations connected by paths. Same thing, different words! In this case, my original idea was that the hexagon tiles were the locations (i.e., vertices), and each of the six sides of the tile would either be open or blocked, potentially making a path to the adjacent tile. The question,