Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search - Coggle Diagram
Adversarial Search
Applications in games
Firstly, it should be a 2-player game.
-
-
-
-
-
MIN-MAX Algorithm
Mini-max algorithm is a recursive or backtracking algorithm which is used in decision-making and game theory. It provides an optimal move for the player assuming that opponent is also playing optimally.
-
-
What is Adversarial Search ?
In AI, a search algorithm is an algorithm for finding an item with specified properties among a collection of items. The items may be stored individually as records in a database; or may be elements of a search space defined by a mathematical formula or procedure.
Adversarial search in Game playing :
“ In which we examine the problems that arise when we try to plan ahead in a world where other agents are planning against us”
-