Answers.Body: <p>A DeepStack-style algorithm only requires that you have a way of approximating equilibrium counterfactual values for subtrees at the leaves of lookahead trees from each of its decision points. So if I'm acting at the beginning of the pre-flop and I only have the time and memory available to look ahead to the start of the flop, then I need to approximate the equilibrium counterfactual values at the root of each subtree that begins at the start of the flop.</p>
  
  <p>DeepStack as in the Science paper's study used three neural networks, one for values at the end of the pre-flop, one at the beginning of the flop, and one at the beginning of the turn. These, along with the lookahead tree data structures, had to fit onto the 8GB of GPU memory on the 1080. Although not needed while playing, the networks were trained on millions of examples (ten million for the pre-flop and turn networks, and one million for the flop network).</p>
  
  <p>We have an <a href="https://github.com/lifrordi/DeepStack-Leduc" rel="noreferrer">example DeepStack implementation on GitHub that plays Leduc hold'em</a> if you want to look at some of the programming details in greater depth. Leduc hold'em is a small toy poker game that is commonly used in the poker research community.</p>
  
  <p>The DeepStack algorithm arises out of a mathematically rigorous approach to approximating Nash equilibria in two-player, zero-sum, imperfect information games. Most of the strong poker AI to date attempt to approximate a Nash equilibria to one degree or another. So rather than analyzing poker specifically, we usually use an analysis of properties of imperfect information games more generally to get a general algorithm, then we apply these techniques to poker as a specific example of an imperfect information game.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2017-10-05T21:56:21.400Z
Answers.LastActivityDate: 2017-10-05T21:56:21.400Z
Answers.UserDisplayName: Dustin Morrill
Body: <p>I was reading a little bit about the Deepstack poker program:</p>
  
  <p><a href="https://www.ualberta.ca/science/science-news/2017/march/artificial-intelligence-deepstack-outplays-poker-professionals" rel="nofollow noreferrer">DeepStack the first computer program to outplay human professionals at heads-up no-limit Texas hold'em poker</a></p>
  
  <p><a href="https://arxiv.org/pdf/1701.01724.pdf" rel="nofollow noreferrer">DeepStack: Expert-Level Artificial Intelligence in
  Heads-Up No-Limit Poker</a></p>
  
  <p>The first article mentions processor used was an NVIDIA GeForce GTX 1080 graphics card, but I'm trying to get an understanding of how much memory this type of AI requires.</p>
  
  <p>Related: How much has recent work in mathematical analysis of poker contributed to Deepstack and other strong poker AI? </p>
  
Tags: <game-ai><poker><deepstack>
Title: How much memory does the Deepstack poker program require?
UserDisplayName: DukeZhou
ThreadText: # How much memory does the Deepstack poker program require?
  
  (Asked by: username_0 on 2017-10-05)
  
  I was reading a little bit about the Deepstack poker program:
  
  [DeepStack the first computer program to outplay human professionals at heads-up no-limit Texas hold'em poker](https://www.ualberta.ca/science/science-news/2017/march/artificial-intelligence-deepstack-outplays-poker-professionals)
  
  [DeepStack: Expert-Level Artificial Intelligence in
  Heads-Up No-Limit Poker](https://arxiv.org/pdf/1701.01724.pdf)
  
  The first article mentions processor used was an NVIDIA GeForce GTX 1080 graphics card, but I'm trying to get an understanding of how much memory this type of AI requires.
  
  Related: How much has recent work in mathematical analysis of poker contributed to Deepstack and other strong poker AI?
  
  **Tags:** game-ai, poker, deepstack
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2017-10-05. Score: 9 | Accepted answer
  
  A DeepStack-style algorithm only requires that you have a way of approximating equilibrium counterfactual values for subtrees at the leaves of lookahead trees from each of its decision points. So if I'm acting at the beginning of the pre-flop and I only have the time and memory available to look ahead to the start of the flop, then I need to approximate the equilibrium counterfactual values at the root of each subtree that begins at the start of the flop.
  
  DeepStack as in the Science paper's study used three neural networks, one for values at the end of the pre-flop, one at the beginning of the flop, and one at the beginning of the turn. These, along with the lookahead tree data structures, had to fit onto the 8GB of GPU memory on the 1080. Although not needed while playing, the networks were trained on millions of examples (ten million for the pre-flop and turn networks, and one million for the flop network).
  
  We have an [example DeepStack implementation on GitHub that plays Leduc hold'em](https://github.com/lifrordi/DeepStack-Leduc) if you want to look at some of the programming details in greater depth. Leduc hold'em is a small toy poker game that is commonly used in the poker research community.
  
  The DeepStack algorithm arises out of a mathematically rigorous approach to approximating Nash equilibria in two-player, zero-sum, imperfect information games. Most of the strong poker AI to date attempt to approximate a Nash equilibria to one degree or another. So rather than analyzing poker specifically, we usually use an analysis of properties of imperfect information games more generally to get a general algorithm, then we apply these techniques to poker as a specific example of an imperfect information game.
  
  
  ---
  
  