The door to the office is open. If you need to contact me I'm upstairs and my number is[masked] 3015.
On Sep 2,[masked]:39 PM, "Joe" <[address removed]> wrote:
> Hello All,
> Here is a problem in prep for tomorrow morning. Given the following paragraph from the book:
> Up to now, we have not been very careful to distinguish between nodes and states, but in writing detailed algorithms it's important to make that distinction. A node is a bookkeeping data structure used to represent the search tree. A state corresponds to a configuration of the world. Thus, nodes are on particular paths, as defined by PARENT pointers, whereas states are not. Furthermore, two different nodes can contain the same world state if that state is generated via two different search paths.
> p 79 section 3.3
> and given this definition of the data set makeup of a node:
> * node.STATE: the state in the state space to which the node corresponds;
> * node.PARENT: the node in the search tree that generated this node;
> * node.ACTION: the action that was applied to the parent to generate the node;
> * node.PATH-COST: the cost, traditionally denoted by y(ti), of the path from the initial state to the node, as indicated by the parent pointers.
> If the agent searches the action sequence of (Mentor-to-Cleveland,Cleveland-to-Buffalo,Buffalo-to-NYC), what is the data set for the final leaf node reached in that search sequence?
> See you tomorrow,