Chapter 8 - Textbook

Hey all,

I have a couple of questions regarding chapter 8 of the textbook. If anyone can help me please do so, because i would duly appreciate it!!

Ok..

*pg 131 - Am I correct in saying that a successor function is just a grouping of operators. i.e. It contains many functions?




*pg 132 - Am I correct in saying that if we have reached say:

blank 2 3
1 8 4
7 6 5

by node 5 for example, then we cannot use it again in say node 10, even if we have reached it via expanding of a different node (i.e. both instances are not on the same path?)

*Exercise 8.2 on pg 137
for question 1 - Depth-first search, I get the following nodes:
1-2-5-6-10-11-3-7-12-13-4-8-9

Is this correct?


*could anyone solve Exercise 8.1? {pg 137}. If so, please give me a hint on where to start, because I dont know how to solve this question.

Hi Jo_Anne

Question 2: If you get to the same layout in node 10 as node 5 the route through node 10 will not be the shortest because you will find the goal faster through node 5.

I would say your depth first search is correct.

Good Luck

Question 1 is just a way in which you can group all the child nodes.

Once you use the successor function it expands the parent to give the set which contains the child nodes.

Ie if you have a tree with root node A

and its children are B C and D

Call the Successor function to find what children A has.

Question 3

why waste your time doing this question.