       :errors errors)))
 
 
+(defn gcd-initial-report
+  [argmap]
+  (println "Training cases:")
+  (doseq [[i case] (map vector (range) gcd-training-cases)]
+    (println (format "Train Case: %3d | Input/Output: %s" i (str case))))
+  (println ";;******************************"))
+
+
 
 ; Atom generators
 (def gcd-atom-generators
   "Collection of items which will be used to construct random programs: Some integer constants, boolean constants, the input and various standard Push instructions. The relative proportions are stupid and simply the result of poking and prodding with insufficient evidence; feel free to change them."
   (concat
-    (repeat 10 'integer_mod)
     (repeat 10 'in1)
     (repeat 10 'in2)
     (list

        errors (mapv (fn [behavior a-case]
                       (if (int? behavior)
                        (abs-err behavior (last a-case))
                        1000000000000))
                     behaviors
                     cases)]
    (assoc individual

;; gcd.clj
;; Bill Tozier, bill@vagueinnovation.com
;; updated February 24, 2020
;;
;; This is code for finding algorithms which return the greatest common
;;   divisor (GCD) of a pair of integer arguments. See the Wikipedia
