Board Games and Applied Search AI

In this chapter, you will learn a family of algorithms for developing board game AI:

  • Working with the game-tree class
  • Implementing Minimax
  • Implementing Negamax
  • Implementing AB Negamax
  • Implementing NegaScout
  • Implementing a Tic-Tac-Toe rival
  • Implementing a Checkers rival
  • Implementing Rock-Paper-Scissors AI with UCB1
  • Implementing Regret Matching

Get Unity 2018 Artificial Intelligence Cookbook - Second Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.