Please enable JavaScript.
Coggle requires JavaScript to display documents.
AI search - Coggle Diagram
AI search
Adversarial Search
MINMAX
MAX picks the action a that produces the highest value of the min-value(result(s,a))
MIN picks the action a that produces the smallest value of the max-value(result(s,a)
The search where we are searching the solution and the other's opposing the search ex: tic-tac-toe we are trying solution and others block the solution.
-
-
Informed Search
-
-
A* search
consider optimal if
- h(n) is admissible( never overestimate the true cost)
- h(n) is consistent (for every node n and successor n' with the step cost c, h(n) <=h(n')+c)
-