6.01 Lecture Notes - Lecture 28: Bundesautobahn 48, City Map, Init
Document Summary
We will need a way to represent the tree as a python data structure as we construct it during the search process. We will start by de ning a class to represent a search node, which is one of the circles in the tree. Each search node represents: the state of the node, the action that was taken to arrive at the node; and, the search node from which this node can be reached. We will call the node from which a node can be reached its parent node. H we will represent the node with double circles around it with its state, "d", the action that reached it, 1, and its parent node, which is the node labeled "b" above it. Note that states and nodes are not the same thing! In this tree, there are many nodes labeled by the same state; they represent di erent paths to and through the state.