Haskell, Genetic Algorithm, Graph Theory, Programming.
orientation. Flipping the tiles so either side is equally likely to be visible. Here’s that code: rotateTile :: Int -> Tile -> Tile rotateTile n | n > 0 = rotateTile (n - 1) . rot | n < 0 = rotateTile (n + 6) | otherwise = id where rot (Tile top bottom) = Tile (map (map clockwise) top) bottom