Implementing Search Algorithm
<p>How can I call a search algorithm? I've just been introduced to the concept, and I saw an example:</p>

<blockquote>
  <p>The states are the integers.</p>
  
  <ul>
  <li>The initial state is some integer; let’s say 1.</li>
  <li>Any state n has the following children: f2n; n + 1; n - 1; n2;-ng.</li>
  <li>The goal test is lambda x: x == 10 .</li>
  </ul>
  
  <p>So, the idea would be to find a short sequence of operations to move from 1 to 10.</p>
</blockquote>

<pre><code>class NumericSearchNode(search.SearchNode):
    def getChildren(self):
        n = self.state
        return [n*2, n+1, n-1, n**2, -n]

    def goalTest(state):
        return state == 10

StartNode = NumericSearchNode(1, parent = None)
</code></pre>

<p>The class search is predefined in my file. However, can I possibly look at the path this <code>NumericSearchNode</code> is going to get? </p>

<p>I tried calling in the shell <code>print NumericSearchNode(1, None, c=0)</code> and it only returns <code>&lt;__main__.NumericSearchNode instance at 0x01EC0558&gt;</code></p>
