CSCE 476/876, Fall 2017, Glossary 4
Assigned: Monday, Sep 18, 2017.
Due: Monday, Sep 25, 2017.
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.
- g(n), h(n), f(n), C* (4 points)
- A* search
- Admissible heuristic
- Backtracking search
- Belief State
- Best-first search
- Bidirectional search
- Blind search
- Breadth-first search
- Coercion
- Consistency (as a property of the h function)
- Contengincy problem
- Contours
- Depth-first search
- Depth-limited search
- Diameter (of a graph). Look in graph theory.
- Domination (of two functions)
- Effective branching factor
- Exploration problem
- Greedy algorithm
- Heuristic function
- Heuristic search
- Informed search
- Iterative-Deepening search
- Iterative-Lengthening search
- Knowledge acquisition
- Manhattan distance
- Monotonicity (as a property of the h function)
- Optimally efficient
- Pathmax equation (not in your books)
- Predecessors
- Pruning
- Relaxed problem
- Straight-line distance
- Triangle inequality
- Uniform-cost search
- Uninformed search
Berthe Y. Choueiry
choueiry@cse.unl.edu