# Adversarial Search

### Table of contents

## Minimax

The algorithm will attempt to find the best action that an agent can take, assuming that an opposing force is trying to minimize its results.

Provide the leafs nodes for the tree to see how the algorithm will solve different problems.

## Alpha Beta Pruning

A slight modification to minimax, Alpha Beta Pruning will try to improve performance by ignoring nodes that cannot possibly provide a better outcome.

Provide the leafs nodes for the tree to see how the algorithm will solve different problems.