Haskell, Genetic Algorithm, Graph Theory, Programming.
tiles), -0.02 * fromIntegral (dupScore tiles), -1 * fromIntegral (numFullyConnected tiles) ] ++ map (/ fromIntegral n) graphScores where (graphScores, _) = foldl' next (repeat 0, g) (replicate n tiles) next (soFar, g1) tiles = let (g2, shuffled) = shuffleTiles g1 tiles in (zipWith (+) soFar