morning

Author: hmp-anthony

.search_2.py.swp

@@ -25,7 +25,6 @@ def h(self, node):               return 0
     def __str__(self):
         return '{}({!r}, {!r})'.format(
             type(self).__name__, self.initial, self.goal)
-    
 
 class Node:
     "A Node in a search tree."
@@ -39,8 +38,7 @@ def __lt__(self, other): return self.path_cost < other.path_cost
 
 failure = Node('failure', path_cost=math.inf) # Indicates an algorithm couldn't find a solution.
 cutoff  = Node('cutoff',  path_cost=math.inf) # Indicates iterative deepening search was cut off.
-    
-    
+
 def expand(problem, node):
     "Expand a node, generating the children nodes."
     s = node.state

search_2.py

@@ -0,0 +1,3 @@
+from search_2 import *
+
+print_test()