Skip to Main Content
Deep Learning and the Game of Go
book

Deep Learning and the Game of Go

by Kevin Ferguson, Max Pumperla
January 2019
Intermediate to advanced content levelIntermediate to advanced
384 pages
13h 27m
English
Manning Publications
Content preview from Deep Learning and the Game of Go

Chapter 4. Playing games with tree search

This chapter covers

  • Finding the best move with the minimax algorithm
  • Pruning minimax tree search to speed it up
  • Applying Monte Carlo tree search to games

Suppose you’re given two tasks. The first is to write a computer program that plays chess. The second is to write a program that plans how to efficiently pick orders in a warehouse. What could these programs have in common? At first glance, not much. But if you step back and think in abstract terms, you can see a few parallels:

  • You have a sequence of decisions to make. In chess, your decisions are about which piece to move. In the warehouse, your decisions are about which item to pick up next.
  • Early decisions can affect future decisions. In chess, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Deep Learning

Deep Learning

Andrew Glassner
Deep Learning with PyTorch

Deep Learning with PyTorch

Eli Stevens, Thomas Viehmann, Luca Pietro Giovanni Antiga

Publisher Resources

ISBN: 9781617295324Supplemental ContentPublisher SupportOtherPublisher WebsitePurchase Link