 (check-algorithm-properties "sidewinder")
 (check-algorithm-properties "aldous-broder")
 (check-algorithm-properties "wilsons")
+;; The following two cannot yet pass :each-changes and :updates-link-2
 (check-algorithm-properties "hunt-and-kill" :perfect :first-new :all-changed)
 (check-algorithm-properties "recursive-backtracker" :perfect :first-new :all-changed)
 

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