Term
|
Definition
Uninformed Search
CPU intensive
Memory intensive
Optimal in steps
Complete
Exhaustive |
|
|
Term
|
Definition
Informed Search
Not CPU intensive
Not memory intensive
not optimal
not complete
exhaustive |
|
|
Term
|
Definition
Uninformed search
CPU intensive
Memory intensive
Optimal in cost or distance
Complete
Exhaustive |
|
|
Term
|
Definition
Informed
Somewhat CPU intensive
Somewhat Memory intensive
Optimal in cost or distance if heuristic is admissible
Complete
Exhaustive |
|
|
Term
|
Definition
Uninformed Search
CPU intensive
Memory friendly. Only requires enough memory to store the call stack.
Not optimal - returns the first solution it finds
Not complete - it may go in the wrong direction and never return.
Exhaustive |
|
|
Term
| Iteratively Deepening Depth-First Search |
|
Definition
Uninformed
CPU intensive
Memory friendly
Optimal(is depth is iterated one step at a time) in steps
Complete
Exhaustive |
|
|
Term
|
Definition
| When the heuristic is admissible!!!!!!!!!! |
|
|
Term
| What does uninformed mean? |
|
Definition
| The search doesn't have information about its prior moves or the goal |
|
|
Term
|
Definition
| The search has information about its prior moves and it's goal |
|
|
Term
|
Definition
| how"good" the solution is |
|
|
Term
|
Definition
| If the solution is guaranteed |
|
|
Term
| What does exhaustive mean? |
|
Definition
| Will find a solution is the state space is finite. |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
| F = G + H * hw(heuristic weight) |
|
|
Term
| What are the required components of a waypoint |
|
Definition
location
connections (vector of edges)
|
|
|
Term
| What are the required components of an edge? |
|
Definition
|
|
Term
| What is the neighbour of an waypoint? |
|
Definition
|
|
Term
| What are teh benefits and weaknesses to trial and error searches? |
|
Definition
minimal CPU time and memory
Suffer from lack of foresight, and may fail to even find a path |
|
|
Term
| How do you find given cost? |
|
Definition
| node->givenCost = parent->givenCost + node->tile->weight * distance(node, parent); |
|
|
Term
| What are the benefits and disadvantages to Depth-First search? |
|
Definition
Benefits:
Low Memory usage
Problems:
Has no memory of past events
takes a long time to execute
is neither nor complete |
|
|
Term
| How do you calculate the given cost for a waypoint? |
|
Definition
| current->givenCost + current->waypoint->connections[i]->cost; |
|
|
