Haskell, Genetic Algorithm, Graph Theory, Programming.
"Spring" "Exit" g then 1.0 else 0.0, if hasPath "Lair" "Orchard" g then 1.0 else 0.0, if hasPath "Lair" "Exit" g then 1.0 else 0.0, if hasPath "Orchard" "Exit" g then 1.0 else 0.0 ] The result of scoring is a list of individual scores, which will be added together to determine the overall fitness.