Worksheet #4
Best-First-Search
- The next program can be found at /home/atlas1/ai/bestfirst.lsp.
Run this program and understand how it works.
- Write a paragraph, or two, or three, discussing the workings of this new
search algorithm. Tell what each of the salient variables do (n, closed, etc.).
Explain the important functions such as open-node and what they do.
Use a word processor unless your handwriting is unusually legible!
- Briefly describe how this search is different from the search in worksheet #3.
What is the technique for avoiding "circular paths"?
- Using the sheet provided write out a trace from REN to AV.
