Haskell, Genetic Algorithm, Graph Theory, Programming.
-> [Double] scoreGraph g = [ -0.1 * fromIntegral (extraEdges g), if hasPath "Hut" "Well" g then 1.0 else 0.0, if hasPath "Hut" "Spring" g then 1.0 else 0.0, if hasPath "Hut" "Lair" g then 1.0 else 0.0, if hasPath "Hut" "Orchard" g then 1.0 else 0.0, if hasPath "Hut" "Exit" g then 1.0 else 0.0, if