Haskell, Genetic Algorithm, Graph Theory, Programming.
three different paths. But never fear: another change of perspective simplifies the matter. Instead of considering the graph where each tile or path is a vertex, we will consider the dual graph, where each border is a vertex, like this: The dual of the maze graph Now we once again have a fixed