Skip to Content
Reinforcement Learning with TensorFlow
book

Reinforcement Learning with TensorFlow

by Sayon Dutta
April 2018
Intermediate to advanced content levelIntermediate to advanced
334 pages
10h 18m
English
Packt Publishing
Content preview from Reinforcement Learning with TensorFlow

How did DeepBlue defeat Gary Kasparov?

In Chapter 5Q-Learning and Deep Q Networks, we studied game trees and minimax algorithms. Let's recall those approaches to understand the architecture behind the AI program of IBM DeepBlue. 

A game tree represents the full end-to-end representation of a game, where each node in the tree represents a particular game state (position) and the edges linking the nodes represent the moves (actions) taken at previous game states leading to a new game state. The root node represents the start of the game and nodes in the next level represent the possible states generated after all different possible actions have been taken at the start state of the game and similarly nodes in the further layers are generated. ...

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 with TensorFlow - Second Edition

Deep Learning with TensorFlow - Second Edition

Giancarlo Zaccone, Vihan Jain, Md. Rezaul Karim, Motaz Saad
Deep Learning with TensorFlow 2 and Keras - Second Edition

Deep Learning with TensorFlow 2 and Keras - Second Edition

Antonio Gulli, Dr. Amita Kapoor, Sujit Pal

Publisher Resources

ISBN: 9781788835725Supplemental Content