Summary

In this chapter, we discussed how to build games using a special type of artificial intelligence technique called combinatorial search. We learned how to use these types of search algorithms to effectively come up with strategies to win games. These algorithms can be used to build game playing machines for more complicated games as well as solve a wide variety of problems. We talked about combinatorial search and how it can be used to speed up the search process. We learned about Minimax and Alpha-Beta pruning. We learned how the Negamax algorithm is used in practice. We then used these algorithms to build bots to play Last Coin Standing and Tic-Tac-Toe.

We learned how to build two bots to play against each other in Connect Four and Hexapawn. In the next chapter, we will learn about speech recognition and build a system to automatically recognize spoken words.