3.6 The GENERAL-SEARCH algorithm consists of three steps: goal test, generate, and ordering! function, in that order.

Question:

3.6 The GENERAL-SEARCH algorithm consists of three steps: goal test, generate, and ordering!

function, in that order. It seems a shame to generate a node that is in fact a solution, but to fail to|

recognize it because the ordering function fails to place it first.

a. Write a version of GENERAL-SEARCH that tests each node as soon as it is generated and|

stops immediately if it has found a goal.

b. Show how the GENERAL-SEARCH algorithm can be used unchanged to do this by giving it|

the proper ordering function.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: