Haskell, Genetic Algorithm, Graph Theory, Programming.
connect those five vertices with an acyclic graph requires four edges rather than ten. It doesn’t matter to us which four edges those are; they only exist in theory, and don’t change how the tile is drawn. But it’s important to only count them as four. Now, 76 edges feels like an exorbitant number