Haskell, Genetic Algorithm, Graph Theory, Programming.
Direction clockwise N = NE clockwise NE = SE clockwise SE = S clockwise S = SW clockwise SW = NW clockwise NW = N Now the decoding: decodeTile :: [Bool] -> Tile decodeTile bs = Tile (postproc a) (postproc b) where trailNums = map (decodeBinary (0 :: Int, 3)) (splitEvery trailSize bs) trail nums n =