CSCE 476/876, Spring 2015, Glossary 3

Assigned:  Friday, Febuary 5, 2016.

Note: Glossaries will not be collected or corrected, but terms will appear as bonus on quizzes.
  1. Abstraction (definition, goal, example)  (3 points)
  2. Branching factor
  3. Complete-state formulation
  4. Completeness (of an algorithm)
  5. Fringe (in search)
  6. Frontier (in search)
  7. Goal test 
  8. Incremental formulation
  9. Initial state
  10. Intractability
  11. Loopy path
  12. Leaf node (in search)
  13. Missionaries and cannibals problem    
  14. n-queen problem    
  15. Node expansion (in search)
  16. Open-loop
  17. Operator    
  18. Optimal solution
  19. Path    
  20. Path cost    
  21. Problem formulation  
  22. Planning    
  23. Route-finding problem
  24. Search    
  25. Search cost (vs. total cost)    
  26. Search node
  27. Search strategy
  28. Search tree
  29. Solution quality
  30. State space    
  31. Step cost    
  32. Successor function (in search)    
  33. Touring problems 
  34. Toy problem
  35. (2 points) Traveling Salesperson (optimization) Problem (TSP) (give a formal definition)
Berthe Y. Choueiry
choueiry@cse.unl.edu