Please enable JavaScript.
Coggle requires JavaScript to display documents.
Adversarial Search
Adversarial Search in a game play point of view &…
Adversarial Search
Adversarial Search in a game play point of view & it's a way of examine the problem when we try to plan ahead of the world enemies are planning against us.
-
-
-
-
-
-
-
:star:Pruning does not affect final result.
:star:The effectiveness of alpha beta pruning is highly dependent on the order of successors.
:star:Try to examine first the successors that are
-
:star: Should be the 2 player game.
:star: Players alternate the moves.
:star: Clear rules for legal moves.
:star: Using dice is not involved.
Min Max is a kind of backtracking algorithm that is used in decision making and game theory to find the optimal move for a player,assuming that your opponent also plays optimally. Mostly used in two player turn based games such as Tic-Tac-Toe & Chess (GeeksforGeeks,2018)
Idea:Start propagating scores as soon as leaf nodes are generated & nodes cannot effect to the choice of move.
:star:search tree generated by mini-max is
called Alpha Beta
Problem with mini-max - number of game states to search is exponential in depth of tree.
Alpha = value of best choice (highest) along Max’s path.
Beta = value of best choice (lowest) along Min’s path.