Revision 910e748d183ed81f6dcb8ae21c76eb415a653f18 (click the page title to view the current version)

Adversarial Search

Changes from 910e748d183ed81f6dcb8ae21c76eb415a653f18 to eb485838c87de2760f9936b9daf98673cebe550c

title: Adversarial Search

# Reading

R&N Chapter 6

+ The fundamental concept is **two-player, zero-sum games**
    + The basic solution technique is **minimax search**
+ Minimax search grows exponentially
    + heuristic searches are important (Section 6.3)

# Briefing

# Exercise

## Tic Tac Toe

+ [Code from github](

I was not able to find suitable exercises on CodinGame, so instead,
I have provided a simulator for you.  You should 

1.  Clone the git repo, `git clone`
2.  Change to the `TicTacToe` subdirectory
3.  Modify the template to implement your intelligent agent.
    You should use the minimax algorithm as described for two-player,
    zero sum games.
4.  Play the game, using the test scripts: `python3`
5.  Consult the README file for details.

This assumes that you have git and python3 installed.