3.3 Data Structures for Search

  • As well as the state information a node in a search tree needs additional housekeeping information.

  • Information in a node is:

    1. The state in the search space to which the node corresponds

    2. Parent node

    3. Operator applied to parent to generate this node

    4. Depth of the node (links from root)

    5. Path Cost

  • Some searches, such as heuristic search, will require additional fields


[MAIN PAGE] [PREVIOUS PAGE] [NEXT PAGE]
RMiT Copyright © 1999-2002. School of Computer Science &
Information Technology, RMIT University.
Last Modified: 10th January, 2002.