Worksheet #4
Best-First-Search

                                             Name ______________

1. Study the program bestfirst.lsp.
   Run this program and understand how it works.
   
   
   • Write paragraph(s) 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 keyboard for your explanation unless your handwriting is unusually legible!
   
   
   
2. Briefly describe how this search is different from the search in worksheet #3.
   What is the technique for avoiding "circular paths"?
   
   
   
   
3. Use this "tracing" sheet to write out a trace
   of the travel from REN to AV.