paper-with-me

Papers

Approximating Poker Probabilities with Deep Learning

2018-08-22 · Brandon Da Silva

Many poker systems, whether created with heuristics or machine learning, rely on the probability of winning as a key input. However calculating the precise probability using combinatorics is an intractable problem, so instead we approximate it. Monte Carlo simulation is an effective technique that can be used to approximate the probability that a player will win and/or tie a hand. However, without the use of a memory-intensive lookup table or a supercomputer, it becomes infeasible to run millions of times when training an agent with self-play. To combat the space-time tradeoff, we use deep learning to approximate the probabilities obtained from the Monte Carlo simulation with high accuracy. The learned model proves to be a lightweight alternative to Monte Carlo simulation, which ultimately allows us to use the probabilities as inputs during self-play efficiently. The source code and optimized neural network can be found at https://github.com/brandinho/Poker-Probability-Approximation

📄 PDF Abstract BibTeX arXiv:1808.07220

Code (1)

brandinho/Poker-Probability-Approximation 공식 구현 tf

Tasks

Card GamesDeep LearningGame of Poker

Similar Papers 제목 키워드 기반

Most Important Fundamental Rule of Poker Strategy

2019-06-08 · Sam Ganzfried, Max Chiswick

Poker is a large complex game of imperfect information, which has been singled out as a major AI challenge problem. Recently there has been a series of breakthroughs culminating in agents that have successfully defeated …

Game of Poker

Computing Human-Understandable Strategies

2016-12-19 · Sam Ganzfried, Farzana Yusuf

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive …

Approximate exploitability: Learning a best response in large games

2020-04-20 · Finbarr Timbers, Nolan Bard, Edward Lockhart, Marc Lanctot 외

Researchers have demonstrated that neural networks are vulnerable to adversarial examples and subtle environment changes, both of which one can view as a form of distribution shift. To humans, the resulting errors can lo…

Deep Reinforcement Learning

PokerKit: A Comprehensive Python Library for Fine-Grained Multi-Variant Poker Game Simulations

2023-08-08 · Juho Kim

PokerKit is an open-source Python library designed to overcome the restrictions of existing poker game simulation and hand evaluation tools, which typically support only a handful of poker variants and lack flexibility i…

Poker-CNN: A Pattern Learning Strategy for Making Draws and Bets in Poker Games

2015-09-22 · Nikolai Yakovenko, Liangliang Cao, Colin Raffel, James Fan

Poker is a family of card games that includes many variations. We hypothesize that most poker games can be solved as a pattern matching problem, and propose creating a strong poker playing system based on a unified poker…

Card GamesGame of Poker