       (println (pad-right n 20)
                (update-in (run-timed f) [0 0] count)))))
 
-(defn interpolating-heuristic [w depth]
-  #(+ w (* (- 1.0 w) (/ % depth))))
-
-(defn top? [r]
-  (when-let [n (-> r :ts-sp :name)]
-    (when (= (first n) :Pair)
-      (let [n (nth n 2)]
-        (when (= (first n) :SA)
-          (let [n (angelic.search.function-sets/fs-name (second (second n)))]
-;            (println (= n [:dash-tla])) (Thread/sleep 100)
-            (= n [:dash-tla])))))))
-
-(defn flast-choice [s]
-  (if (top? (last s))
-    (last s)
-    (first s)))
+
 
 ;; TODO: first-last ordering.
 ;; Note: right factoring is crucial! (hsould also sub-factor tla refs?)

            [#_ ["dijkstra "#(textbook/uniform-cost-search e true)]
             ["dash-a*" #(da/implicit-dash-a* h8i)]
             ["dash-a*" #(da/implicit-dash-a* h8i :choice-fn flast-choice)]
             ["dash-a*" #(da/implicit-dash-a* h8i :collect? :hierarchical)]
             ["dash-a*" #(da/implicit-dash-a* h8i :choice-fn flast-choice :collect? :hierarchical)]                          
             #_ ["1.0-a*" #(textbook/a*-search e (partial dd/simple-dash-heuristic e 1) true)]
             ["0.9-a*" #(textbook/a*-search e (partial dd/simple-dash-heuristic e 0.9) true)]
             #_ ["0.8-a*" #(textbook/a*-search e (partial dd/simple-dash-heuristic e 0.8) true)]
             
             #_ ["1.0-opt-ah-a*"

             512 nil ::ExpResult)))
      (count +dm-sizes+) +dm-reps+]]))

#_ (do (use 'angelic.scripts.thesis 'angelic.util.experiments 'angelic.util.cluster)
       (cluster-smart-runner (make-dm-exps) false (str *default-run-dir* "/thesis-dm/")))


(comment
 ;; DASH-A* blows the stack on the cluster for no good reason, so I'm running
