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