Find a state t h a t satisfies goal-p. Start with states, and search according to successors
Question:
"Find a state t h a t satisfies goal-p. Start with states, and search according to successors and combiner."
(dbg :search ""&;; Search: "a" states)
(cond ((null states) fail
((funcall goal -p ( f i r s t states)) ( f i r s t states))
(t (tree-search
(funcall combiner
(funcall successors ( f i r s t states))
(rest states))
goal -p successors combiner 1) 1)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Paradigms Of Artificial Intelligence Programming Case Studies In Common Lisp
ISBN: 9781558601918
1st Edition
Authors: Peter Norvig
Question Posted: