Adversarial Search : Minimax Algorithm for two player games - hypernaturalgames.com

Adversarial Search : Minimax Algorithm for two player games

IIT Delhi July 2018
Views: 22681
Like: 203

8 Comments

  1. Before this game begins we are assuming both computer and human are equally smart.
    Computer is gonna take the best move for itself, human gonna take the worst move to prevent the computer from winning.
    If you see the top most node can take 3 plys. A1, A2,A3.

    Lets assume the computer takes the ply A1. From there the opponent also gets to take 3 plys. A11, A12, A13. And the opponent is obviously gonna take A11. Coz it is only in that scenario, that the computer ends up with just 3 points. If the opponent happens to take A12 or A13, computer will get a much better score of 12 or 8. But that shouldnt happen, coz the opponent is fucking smart.
    Lets assume the computer takes the ply A2. From there the opponent also gets to take 3 plys. A21, A22, A23. And the opponent is obviously gonna take A21. Coz it is only in that scenario, that the computer ends up with just 2 points. If the opponent happens to take A22 or A23, computer will get a much better score of 4 or 6. But that shouldnt happen, coz the opponent is fucking smart.
    Lets assume the computer takes the ply A3. From there the opponent also gets to take 3 plys. A31, A32, A33. And the opponent is obviously gonna take A33. Coz it is only in that scenario, that the computer ends up with just 2 points. If the opponent happens to take A31 or A32, computer will get a much better score of 14 or 5. But that shouldnt happen, coz the opponent is fucking smart.

    Not lets backtrack
    if the ply is A1, worst possible utility = 3points
    if the ply is A2, worst possible utility = 2points
    if the ply is A3, worst possible utility = 2points

    So its wise for the computer to take the play A1. Among all the worst cases…..it atleast ends up at a better worst case.(3 points)
    Thats why we have written the backtracked points near every triangle in top level and 2nd level.

  2. I think computer will take A3 because this will lead to 5 which is maximum

  3. Really awesome lectures so far! All these algorithms feel so simple.

Leave a Reply

Your email address will not be published.