 ;;     reported twice).
 ;; * (maybe) if no intermediate-chan, the result grid shows all cells changed
 
-;; What kinds of properties can I asert about find-distances?
+;; What kinds of properties can I assert about find-distances?
 ;;
 ;; * Each cell is changed exactly once
 ;; * :max is monotonically increasing (starting with 1)

               ;(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


;; 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
;; the algorithms means that any particular example I come up with might not
;; expose all of the issues.
;;
