We will be looking here for one solution only
Expand a state (find its successors / descendants / children / adjacent states)
Forward strategy
Backwards strategy
Bidirectional search
Exit:
A final state has been reached [Success]
All reachable states have been explored and no solution has been found [Failure]
After success – usually reconstruct the solution path
Sunday 18 January 2009
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment