Please enable JavaScript.

Coggle requires JavaScript to display documents.

Adversarial Search - Coggle Diagram

- - - - Optimization of agent performance.
      - Strategic interaction among rational agents.
      - Conflict and cooperation.
- - - - Large search spaces make brute-force search infeasible (Chess).
    - - Recursively explores game tree, assuming optimal play from both players (Max and Min).
    - - Techniques to reduce search space without losing optimality (Alpha-Beta Pruning).
- - - - MAX (trying to maximize utility) and MIN (trying to minimize MAX's utility).
    - - Initial state (s)
      - Player(s) whose turn it is
      - Legal moves (Actions(s))
      - Transition model (Result(s, a))
      - Terminal test (Terminal-Test(s)) - is the game over?
      - Utility function (Utility(s, p)) - payoff for player 'p' at a terminal state
    - - Represents states (nodes) and moves (edges).
    - - Utility values become vectors.