Game Trees

Single Agent Tree

for single agent tree, it just needs to find the maximum from children nodes and go up.

Adversarial Game Trees

Since a zero-sum turn play adversarial game will go back and forth of the agent and its opponent’s control, if both are choosing optimally, agent would choose the maximum but opponent will choose the minimum of the successors to interrupt the agent.

Minimax Adeversarial Search

• One player maximizes result
• The opponent minimizes result
• Players alternate turns

implementation