                                               (if (nil? canvas-cell) {:type :nil} canvas-cell))}))))
                            cells-xy))
         cells (f canvas)]
-   (print-cells cells)
+   ;(print-cells cells)
    cells))
 
 (defn rand-int-range [min max]

        fcg          (points-to-fully-connected-graph room-centers)
        ;; g is a list of [[x1 y1] [x2 y2]] elements. List of pairs of points.
        g            (graph-to-minimum-spanning-tree fcg)
        ;; reduce over g
        cells        (reduce (fn [cells [start goal]]
                               (let [points (make-corridor-points cells room-centers-to-room-bounds start goal)]

                             g)
        upstairs     (conj [(first room-centers)] {:type :up-stairs})
        downstairs   (conj [(last room-centers)] {:type :down-stairs})]
    ;(println "fcg" fcg)
    (println "g" g)
    (println "more-edges" more-edges)
    ;(println (vec room-bounds))
    ;(println (vec rooms))
    {:place cells #_(apply merge-with-canvas (canvas width height)
