CSCE 476/876, Fall 2019, Glossary 3
Assigned: Monday, Sep 23, 2019.
Due: Monday, Sep 30, 2019.
Note: Glossaries are optional but help you improve your grade. Clearly
acknowledge your sources (textbook, slides, etc.) or no credit will be given.
You are not allowed to cut and paste from any source.
- Abstraction (definition, goal, example) (3 points)
- Branching factor
- Complete-state formulation
- Completeness (of an algorithm)
- Fringe (in search)
- Frontier (in search)
- Goal test
- Incremental formulation
- Initial state
- Intractability
- Loopy path
- Leaf node (in search)
- Missionaries and cannibals problem
- n-queen problem
- Node expansion (in search)
- Open-loop
- Operator
- Optimal solution
- Path
- Path cost
- Problem formulation
- Planning
- Route-finding problem
- Search
- Search cost (vs. total cost)
- Search node
- Search strategy
- Search tree
- Solution quality
- State space
- Step cost
- Successor function (in search)
- Touring problems
- Toy problem
- (2 points) Traveling Salesperson (optimization) Problem (TSP) (give a formal definition)
Berthe Y. Choueiry
choueiry@cse.unl.edu