From Deep Blue to Monte Carlo

Updates

July 28: Updated tutorial 6. Final version of all slides.
July 27: Added tutorial 6. Small fixes to tutorials 1-5. Changes to be described.
July 25: Small fixes, version 2 of slide sets 2, 3, 4. If you have already downloaded version 1, take a look at the changes.
July 14: Slide sets 1-5 version 1 finalized. Tutorial 6 not done yet.

Overview

Welcome to the AAAI-14 tutorial
MA1 (FULL DAY): From Deep Blue to Monte Carlo: An Update on Game Tree Research

Presenters: Akihiro Kishimoto and Martin Müller

Time: Monday, July 28

Location: Room 302A/B

Schedule

Morning Session 9:00 AM - 1:00 PM

9:00 - 10:00 Tutorial 1: Overview, introduction, general concepts (Martin)
Slides-1-Introduction (pdf)
10:00 - 10:30 Tutorial 2: Solving games, and/or trees, solution tree, Playing games: Heuristics, endgame databases, opening books (Kishi)
Slides-2-Solving and Playing Games (pdf)
10:30 - 11 Coffee break
11 - 12:30 Tutorial 3: alphabeta and enhancements (Kishi)
Slides-3-Alphabeta (pdf)
12:30 - 1 Tutorial 4: Proof Number Search (Kishi)
Slides-4-Proof-Number Search (pdf)

Afternoon Session 2:00 PM - 6:00 PM

2 - 3 Continue Tutorial 4: Proof Number Search (Kishi)
3 - 3:30 Tutorial 5: Monte Carlo Tree Search (Martin)
Slides-5-MCTS (pdf)
3:30 - 4 Coffee break
4 - 5:30 Continue Tutorial 5: Monte Carlo Tree Search (Martin)
5:30 - 6 Tutorial 6: State of the art in specific games. Wrap-up (Martin)
Slides-6-Specific Games, Summary (pdf)

References

References are provided in both pdf and BibTeX format. The pdf files have some notes and group the references within each topic by subtopics. ``General'' covers all topics other than PNS and MCTS.

References-General (pdf) References-General (BibTeX)
References-PNS (pdf) References-PNS (BibTeX)
References-MCTS (pdf) References-MCTS (BibTeX)

Created: Jun 6, 2014 Last modified: Jul 25, 2014

Martin Müller