{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/approximating-poker-probabilities-with-deep","title":"Approximating Poker Probabilities with Deep Learning","arxiv_id":"1808.07220","date":"2018-08-22","proceeding":null,"authors":["Brandon Da Silva"],"abstract":"Many poker systems, whether created with heuristics or machine learning, rely\non the probability of winning as a key input. However calculating the precise\nprobability using combinatorics is an intractable problem, so instead we\napproximate it. Monte Carlo simulation is an effective technique that can be\nused to approximate the probability that a player will win and/or tie a hand.\nHowever, without the use of a memory-intensive lookup table or a supercomputer,\nit becomes infeasible to run millions of times when training an agent with\nself-play. To combat the space-time tradeoff, we use deep learning to\napproximate the probabilities obtained from the Monte Carlo simulation with\nhigh accuracy. The learned model proves to be a lightweight alternative to\nMonte Carlo simulation, which ultimately allows us to use the probabilities as\ninputs during self-play efficiently. The source code and optimized neural\nnetwork can be found at\nhttps://github.com/brandinho/Poker-Probability-Approximation","url_abs":"http://arxiv.org/abs/1808.07220v2","url_pdf":"http://arxiv.org/pdf/1808.07220v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"approximating-poker-probabilities-with-deep","repo_url":"https://github.com/brandinho/Poker-Probability-Approximation","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"card-games","task_name":"Card Games"},{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"game-of-poker","task_name":"Game of Poker"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"brandinho/Poker-Probability-Approximation","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f88f388867c7f9fedde77fff604ec1ba0207b3aa6759dcb641cd17c16888e2b7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}