Term
|
Definition
Search method that expands a search tree to the left to the furthest depth of the tree covering all levels of the left branches before going back to the "shallowest" unreached node
-Parent first search |
|
|
Term
|
Definition
| An evaluation concept where if a search strategy is "complete", the solution to a problem should be able to be found if a solution exists. |
|
|
Term
|
Definition
Distance between nodes, not distance between you and the solution (Parent cost less than child).
Starts at root node and traverse tree per node according to least cost. |
|
|
Term
|
Definition
| the amount of space in memory an algorithm uses in order to complete a search |
|
|
Term
|
Definition
| Starting from the start node and the goal node at the same time and searching forward and backward towards the center to cut search time in half |
|
|
Term
|
Definition
| Finding the "best solution" which uses the least amount of time complexity in order to solve the problem |
|
|
Term
|
Definition
| The amount of time an algorithm takes to execute and come to a halting state either finding the searched item of finding that it is not in the data being searched |
|
|
Term
| Advantages of iterative deepening search |
|
Definition
| Searches each level of a tree iteratively and the search stops once the item is found. you can sometimes find the solution faster without searching the entire tree |
|
|
Term
| Disadvantage of the iterative deepening search |
|
Definition
| nodes of all levels are expanded more than once. each iteration has to be stored in memory. |
|
|
Term
| What is the main disadvantage of the hill climbing search (gradient descent) |
|
Definition
| for functions with multiple maxima or minima, search may find a local max or min opposed to the global. |
|
|
Term
| What does "Admissible Heuristic" mean? |
|
Definition
| using an estimation but not over-estimating, using the smallest feasible estimation |
|
|
