Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Min Max Algorithm

    Uploaded by

    sureshroopa2k15

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Min Max Algorithm

    Uploaded by

    sureshroopa2k15
    5 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    5 views2 pages

    Min Max Algorithm

    Uploaded by

    sureshroopa2k15

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    Initial call:

    Minimax(node, 3, true)

    Working of Min-Max Algorithm:

    o The working of the minimax algorithm can be easily described using an example. Below we have taken
    an example of game-tree which is representing the two-player game.
    o In this example, there are two players one is called Maximizer and other is called Minimizer.
    o Maximizer will try to get the Maximum possible score, and Minimizer will try to get the minimum possible
    score.
    o This algorithm applies DFS, so in this game-tree, we have to go all the way through the leaves to reach
    the terminal nodes.
    o 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 two-player game
    tree:
    Step-1: In the first step, the algorithm generates the entire game-tree and apply the utility function 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 worst-case initial value =- infinity, and minimizer will take next turn which has worst-case 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.

    o For node D max(-1,- -∞) => max(-1,4)= 4


    o For Node E max(2, -∞) => max(2, 6)= 6
    o For Node F max(-3, -∞) => max(-3,-5) = -3
    o 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.-
    o For node B= min(4,6) = 4
    o 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.

    o For node A max(4, -3)= 4

    That was the complete workflow of the minimax two player game.

    You might also like