Please enable JavaScript.

Coggle requires JavaScript to display documents.

Adversarial search (Strategy (:red_flag:In fully observable and…

- - - - tictactoe
        
        tictactoe game tree
        
        Minimax algorithm
        
        Normal search - actions lead to goal
        Adversarial search - Max has to consider Min’s moves
        
        Problem with minimax - number of game states to search is exponential in depth of tree
        
        Alpha beta pruning
        
        Alpha = value of best choice (highest) along Max’s path
        
        Beta = value of best choice (lowest) along Min’s path
        
        chess
        
        checkers
        
        othello
        
        go