Skip to content

Latest commit

 

History

History

Games

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Chapter 5: Adversarial Search and Games

Contents

Defining a Game

Connection to search with nondeterministic actions (from Chapter 4.3)

  • Example: Solving Tic-Tac-Toe with And-Or-Tree Search. Here the opponent is seen as part of the environment, i.e., each action by the player is followed by an unknown action of the opponent which, from the viewpoint of the player makes the outcomes of actions nondeterministic.

Solving games using adversarial search

Interactive game play

Assignments

Connection to Machine Learning (more in Chapter 19)

  • The example Learn to Score a Tic-Tac-Toe Board by Example uses a neural network trained on self-play data to lean an evaluation function that can be used as a heuristic in Heuristic Minimax Search or as a playout policy for Monte Carlo Search.

Connection to Reinforcement Learning (more in Chapter 22)

License

All code and documents in this repository is provided under Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) License

CC BY-SA 4.0