CSCE 476/876, Spring 2005, Glossary 3

Assigned:  Monday, Feb 6, 2005.
Due:   Monday Feb 14, 2005.
Note: Glossaries are optional but help you improve your grade.
  1. Abstraction (definition, goal, example)  (3 points)
  2. Branching factor
  3. Complete-state formulation
  4. Completeness (of an algorithm)
  5. Fringe (in search)
  6. Goal test 
  7. Incremental formulation
  8. Initial state    
  9. Intractability    
  10. Leaf node (in search)
  11. Missionaries and cannibals problem    
  12. n-queen problem    
  13. Node expansion (in search)
  14. Open-loop
  15. Operator    
  16. Optimal solution
  17. Path    
  18. Path cost    
  19. Problem formulation  
  20. Planning    
  21. Route-finding problem
  22. Search    
  23. Search cost (vs. total cost)    
  24. Search node
  25. Search strategy
  26. Search tree
  27. Solution quality
  28. State space    
  29. Step cost    
  30. Successor function (in search)    
  31. Touring problems 
  32. Toy problem
  33. (2 points) Traveling Salesperson Problem (TSP) (give a formal definition)
Berthe Y. Choueiry
choueiry@cse.unl.edu