 Minimax algorithm is a recursive or backtracking algorithm which is used in decisionmaking and game theory. It provides an optimal move for the player assuming that opponent is also playing optimally.
 MiniMax algorithm uses recursion to search through the gametree.
 MinMax algorithm is mostly used for game playing in AI. Such as Chess, Checkers, tictactoe, go, and various towplayers game. This Algorithm computes the minimax decision for the current state.
 In this algorithm two players play the game, one is called MAX and other is called MIN.
 Both the players fight it as the opponent player gets the minimum benefit while they get the maximum benefit.
 Both Players of the game are opponent of each other, where MAX will select the maximized value and MIN will select the minimized value.
 The minimax algorithm performs a depthfirst search algorithm for the exploration of the complete game tree.
 The minimax algorithm proceeds all the way down to the terminal node of the tree, then backtrack the tree as the recursion.
Pseudocode for MinMax Algorithm:

functionÂ minimax(node,Â depth,Â maximizingPlayer)Â is

ifÂ depthÂ ==0Â orÂ nodeÂ isÂ aÂ terminalÂ nodeÂ then

returnÂ staticÂ evaluationÂ ofÂ node

ifÂ MaximizingPlayerÂ thenÂ Â Â Â Â Â //Â forÂ MaximizerÂ Player

maxEva=Â infinity

Â forÂ eachÂ childÂ ofÂ nodeÂ do

Â eva=Â minimax(child,Â depth1,Â false)

maxEva=Â max(maxEva,eva)Â Â Â Â Â Â Â Â //givesÂ MaximumÂ ofÂ theÂ values

returnÂ maxEva

Â Â elseÂ Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â //Â forÂ MinimizerÂ player

Â minEva=Â +infinity

Â forÂ eachÂ childÂ ofÂ nodeÂ do

Â eva=Â minimax(child,Â depth1,Â true)

Â minEva=Â min(minEva,Â eva)Â Â Â Â Â Â Â Â Â //givesÂ minimumÂ ofÂ theÂ values

Â returnÂ minEva
Initial call:
Minimax(node, 3, true)
Working of MinMax Algorithm:
 The working of the minimax algorithm can be easily described using an example. Below we have taken an example of gametree which is representing the twoplayer game.
 In this example, there are two players one is called Maximizer and other is called Minimizer.
 Maximizer will try to get the Maximum possible score, and Minimizer will try to get the minimum possible score.
 This algorithm applies DFS, so in this gametree, we have to go all the way through the leaves to reach the terminal nodes.
 At the terminal node, the terminal values are given so we will compare those value and backtrack the tree until the initial state occurs. Following are the main steps involved in solving the twoplayer game tree:
Step1:Â In the first step, the algorithm generates the entire gametree and apply the utility functionsÂ to get the utility values for the terminal states. In the below tree diagram, let’s take A is the initial state of the tree. Suppose maximizer takes first turn which has worstcase initial value = infinity, and minimizer will take next turn which has worstcase initial value = +infinity.
Step 2:Â Now, first we find the utilities value for the Maximizer, its initial value is âˆž, so we will compare each value in terminal state with initial value of Maximizer and determines the higher nodes values. It will find the maximum among the all.
 For node D Â Â Â Â max(1, âˆž) => max(1,4)= 4
 For Node E Â Â Â Â max(2, âˆž) => max(2, 6)= 6
 For Node F Â Â Â Â max(3, âˆž) => max(3,5) = 3
 For node G Â Â Â Â max(0, âˆž) = max(0, 7) = 7
Step 3:Â In the next step, it’s a turn for minimizer, so it will compare all nodes value with +âˆž, and will find the 3^{rd}Â layer node values.
 For node B= min(4,6) = 4
 For node C= min (3, 7) = 3
Step 4:Â Now it’s a turn for Maximizer, and it will again choose the maximum of all nodes value and find the maximum value for the root node. In this game tree, there are only 4 layers, hence we reach immediately to the root node, but in real games, there will be more than 4 layers.
 For node A max(4, 3)= 4
That was the complete workflow of the minimax two player game.
Properties of MiniMax algorithm:
 CompleteÂ MinMax algorithm is Complete. It will definitely find a solution (if exist), in the finite search tree.
 OptimalÂ MinMax algorithm is optimal if both opponents are playing optimally.
 Time complexityÂ As it performs DFS for the gametree, so the time complexity of MinMax algorithm isÂ O(b^{m}), where b is branching factor of the gametree, and m is the maximum depth of the tree.
 Space ComplexityÂ Space complexity of Minimax algorithm is also similar to DFS which isÂ O(bm).
Limitation of the minimax Algorithm:
The main drawback of the minimax algorithm is that it gets really slow for complex games such as Chess, go, etc. This type of games has a huge branching factor, and the player has lots of choices to decide. This limitation of the minimax algorithm can be improved fromÂ alphabeta pruningÂ which we have discussed in the next topic.
AlphaBeta Pruning
 Alphabeta pruning is a modified version of the minimax algorithm. It is an optimization technique for the minimax algorithm.
 As we have seen in the minimax search algorithm that the number of game states it has to examine are exponential in depth of the tree. Since we cannot eliminate the exponent, but we can cut it to half. Hence there is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is calledÂ pruning. This involves two threshold parameter Alpha and beta for future expansion, so it is calledÂ alphabeta pruning. It is also called asÂ AlphaBeta Algorithm.
 Alphabeta pruning can be applied at any depth of a tree, and sometimes it not only prune the tree leaves but also entire subtree.
 The twoparameter can be defined as:
 Alpha:Â The best (highestvalue) choice we have found so far at any point along the path of Maximizer. The initial value of alpha isÂ âˆž.
 Beta:Â The best (lowestvalue) choice we have found so far at any point along the path of Minimizer. The initial value of beta isÂ +âˆž.
 The Alphabeta pruning to a standard minimax algorithm returns the same move as the standard algorithm does, but it removes all the nodes which are not really affecting the final decision but making algorithm slow. Hence by pruning these nodes, it makes the algorithm fast.
Condition for Alphabeta pruning:
The main condition which required for alphabeta pruning is:

Î±>=Î²
Key points about alphabeta pruning:
 The Max player will only update the value of alpha.
 The Min player will only update the value of beta.
 While backtracking the tree, the node values will be passed to upper nodes instead of values of alpha and beta.
 We will only pass the alpha, beta values to the child nodes.
Pseudocode for Alphabeta Pruning:

functionÂ minimax(node,Â depth,Â alpha,Â beta,Â maximizingPlayer)Â is

ifÂ depthÂ ==0Â orÂ nodeÂ isÂ aÂ terminalÂ nodeÂ then

returnÂ staticÂ evaluationÂ ofÂ node

Â Â ifÂ MaximizingPlayerÂ thenÂ Â Â Â Â Â //Â forÂ MaximizerÂ Player

Â Â Â maxEva=Â infinity

Â Â Â forÂ eachÂ childÂ ofÂ nodeÂ do

Â Â Â eva=Â minimax(child,Â depth1,Â alpha,Â beta,Â False)

Â Â maxEva=Â max(maxEva,Â eva)

Â Â alpha=Â max(alpha,Â maxEva)

Â Â Â ifÂ beta<=alpha

Â break

Â returnÂ maxEva

Â Â Â Â elseÂ Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â //Â forÂ MinimizerÂ player

Â Â Â minEva=Â +infinity

Â Â Â forÂ eachÂ childÂ ofÂ nodeÂ do

Â Â Â eva=Â minimax(child,Â depth1,Â alpha,Â beta,Â true)

Â Â Â minEva=Â min(minEva,Â eva)

Â Â Â beta=Â min(beta,Â eva)

Â Â Â Â ifÂ beta<=alpha

Â Â break

Â returnÂ minEva
Working of AlphaBeta Pruning:
Let’s take an example of twoplayer search tree to understand the working of Alphabeta pruning
Step 1:Â At the first step the, Max player will start first move from node A where Î±= âˆž and Î²= +âˆž, these value of alpha and beta passed down to node B where again Î±= âˆž and Î²= +âˆž, and Node B passes the same value to its child D.
Step 2:Â At Node D, the value of Î± will be calculated as its turn for Max. The value of Î± is compared with firstly 2 and then 3, and the max (2, 3) = 3 will be the value of Î± at node D and node value will also 3.
Step 3:Â Now algorithm backtrack to node B, where the value of Î² will change as this is a turn of Min, Now Î²= +âˆž, will compare with the available subsequent nodes value, i.e. min (âˆž, 3) = 3, hence at node B now Î±= âˆž, and Î²= 3.
In the next step, algorithm traverse the next successor of Node B which is node E, and the values of Î±= âˆž, and Î²= 3 will also be passed.
Step 4:Â At node E, Max will take its turn, and the value of alpha will change. The current value of alpha will be compared with 5, so max (âˆž, 5) = 5, hence at node E Î±= 5 and Î²= 3, where Î±>=Î², so the right successor of E will be pruned, and algorithm will not traverse it, and the value at node E will be 5.
Step 5:Â At next step, algorithm again backtrack the tree, from node B to node A. At node A, the value of alpha will be changed the maximum available value is 3 as max (âˆž, 3)= 3, and Î²= +âˆž, these two values now passes to right successor of A which is Node C.
At node C, Î±=3 and Î²= +âˆž, and the same values will be passed on to node F.
Step 6:Â At node F, again the value of Î± will be compared with left child which is 0, and max(3,0)= 3, and then compared with right child which is 1, and max(3,1)= 3 still Î± remains 3, but the node value of F will become 1.
Step 7:Â Node F returns the node value 1 to node C, at C Î±= 3 and Î²= +âˆž, here the value of beta will be changed, it will compare with 1 so min (âˆž, 1) = 1. Now at C, Î±=3 and Î²= 1, and again it satisfies the condition Î±>=Î², so the next child of C which is G will be pruned, and the algorithm will not compute the entire subtree G.
Step 8:Â C now returns the value of 1 to A here the best value for A is max (3, 1) = 3. Following is the final game tree which is the showing the nodes which are computed and nodes which has never computed. Hence the optimal value for the maximizer is 3 for this example.
Move Ordering in AlphaBeta pruning:
The effectiveness of alphabeta pruning is highly dependent on the order in which each node is examined. Move order is an important aspect of alphabeta pruning.
It can be of two types:
 Worst ordering:Â In some cases, alphabeta pruning algorithm does not prune any of the leaves of the tree, and works exactly as minimax algorithm. In this case, it also consumes more time because of alphabeta factors, such a move of pruning is called worst ordering. In this case, the best move occurs on the right side of the tree. The time complexity for such an order is O(b^{m}).
 Ideal ordering:Â The ideal ordering for alphabeta pruning occurs when lots of pruning happens in the tree, and best moves occur at the left side of the tree. We apply DFS hence it first search left of the tree and go deep twice as minimax algorithm in the same amount of time. Complexity in ideal ordering is O(b^{m/2}).
Rules to find good ordering:
Following are some rules to find good ordering in alphabeta pruning:
 Occur the best move from the shallowest node.
 Order the nodes in the tree such that the best nodes are checked first.
 Use domain knowledge while finding the best move. Ex: for Chess, try order: captures first, then threats, then forward moves, backward moves.
 We can bookkeep the states, as there is a possibility that states may repeat.
This article has been published from the source link without modifications to the text. Only the headline has been changed.
Source link