Please enable JavaScript.

Coggle requires JavaScript to display documents.

Adversarial Search - Coggle Diagram

- - - - lower bound against any opponent
      - not necessarily best against all opponents
- - - - uses results
    - - seeking out more information
    - - policy focuses resources on important parts of tree
    - - generate ONE new child
    - - one playout from new child
    - - update values on path back to root
  - - - upper confidence bound
      - alo
    - - upper confidence bounds applied to trees
- - - - can cover the first 10-15 moves
  - - - retrograde minimax is starting with i + 1 pieces and look up previous moves once you get to that state
- - - - partically observable cause the cards are suffled and distriubted
    - - make root change nodee, then use expectminimax