                      actual-changes# (actual-changes reports#)]
                  (every? (fn [[a# c#]] (= a# c#)) (partition 2 (interleave actual-changes# update-change-sets#)))))))
 
-       (when (contains? ~specs :updates-link-2)
-         (defspec ~(symbol (str alg-name "-links-two-cells-each-update"))
-           5
-           (prop/for-all [grid# gen-grid]
-             (let [reports# (all-grids (algorithm-functions ~alg-name) grid#)
-                   update-change-sets# (map :changed-cells (rest reports#))
-                   ;deltas# (partition 2 (interleave grids# (rest reports##)))
-                   ;matched-up# (partition 2 (interleave update-change-sets# deltas#))
-                   ]
-               (every? (fn [cs#] (= 2 (count cs#)))
-                       update-change-sets#)))))
        )
     ))
 

;;     reported twice).
;; * (maybe) if no intermediate-chan, the result grid shows all cells changed

;; What kinds of properties can I asert about find-distances?
;;
;; * Each cell is changed exactly once
;; * :max is monotonically increasing (starting with 1)


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