Evolutionary algorithm: Difference between revisions

=={{header|Clojure}}==

Define the evolution parameters (values here per Wikipedia article), with a couple of problem constants.

(def p 0.05) ;mutation probability

 

(def alphabet " ABCDEFGHIJLKLMNOPQRSTUVWXYZ")</lang>

Now the major functions. ''fitness'' simply counts the number of characters matching the target.

(defn perfectly-fit? [s] (= (fitness s) (count target)))

 

(defn mutate [s] (map #(if (< (rand) p) (randc) %) s))</lang>

Finally evolve. At each generation, print the generation number, the parent, and the parent's fitness.

(println generation, (apply str parent), (fitness parent))

(if-not (perfectly-fit? parent)