 
 ;; This seems like a perfect application for property-based testing.  There's
 ;; no way to inspect a maze and prove that it was generated by a correct
-;; implementation of, say. Wilson's algorithm.  And the inherent randomness of
+;; implementation of, say, Wilson's algorithm.  And the inherent randomness of
 ;; the algorithms means that any particular example I come up with might not
 ;; expose all of the issues.
 ;;

               ;(println (str "Change sets: " (into [] (map empty? change-sets#))))
               (every? not-empty change-sets#)))))

       #_(when (contains? ~specs :accurate-changes)
           (defspec ~(symbol (str alg-name "-cells-changed-is-accurate"))
             5

                     actual-changes# (actual-changes reports#)]
                 (every? (fn [[a# c#]] (= a# c#)) (partition 2 (interleave actual-changes# update-change-sets#)))))))

       )
    ))

