Home > Preview
The flashcards below were created by user
finmcoul
on FreezingBlue Flashcards.

Planning Agent
 Uses abstract model of thee world
 asks what if
 Has goal to test conditions against
 considers what the world would be

Reflex Agent
 Don't consider consequences
 Choose action based on current percept
 Consider what the world is

Breadth First Search
 Expands the shallowest nodes first
 Fringe implemented as FIFO

Depth First Search
 Expands deepest node first
 Fringe implemented as LIFO
 Ties are alphabetically broken

Uniform Cost Search
 For structures with weights/costs
 Expands all paths from starting node
 Expands cheapest node path first

Types of Search Heuristics
 Manhattan Distance
 Euclidean Distance

A* Search
 Uniformcost orders by path cost g(n)
 Greedy orders by proximity h(n)
 For heuristic h and actual cost g
 A* is for any node n
 f(n) = g(n) + h(n)

Admissible Heuristics
 A heuristic is admissible if it is larger than the actual value
 A heuristic h is admissible (optimistic) if:
 h(n)≤h*(n)
 where h*(n) is the true cost to a nearest goal

AlphaBeta Pruning
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.


