Haskell, Genetic Algorithm, Graph Theory, Programming.
let’s call it 4 per tile. Here’s the mistake I made when I first considered this graph. The last tile in the set of four examples above connects five different vertices together, so that it’s possible to pass directly between any pair of them. Naively, you might think that corresponds to 10 edges: