forgot to use the tabu algo while generating it's graphs lol

a2/tsp_local.py

@@ -133,9 +133,11 @@ def tenzing_norgay(cities):
     curpath = copy.deepcopy(cities)
     tabu = {get_hashable(cities)}
     laterals = 0
+    steps = 0
     
     # keep trying things til we can no longer try things
     while(1):
+        steps += 1
         child = bester_child(curpath, curcost, tabu)
         if (child[1] < curcost):
             curcost = child[1]
@@ -150,7 +152,7 @@ def tenzing_norgay(cities):
             continue
         break
         
-    return(curpath, curcost)
+    return(curpath, curcost, steps)
 
 
 # returns the hill climbing solution w/ x random restarts for a given input
@@ -379,7 +381,7 @@ def tenzing_norgay_graph():
             # run problem 100 times
             for k in range(0, 100):
                 # path, cost, steps returned
-                result = solver(filepath, 1)
+                result = solver(filepath, 2)
                 prob_steps += result[2]
                 prob_scores += (result[1] / neos[i][j - 1])
                 if (result[1] <= neos[i][j- 1]):