<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>DecisionHoldem: Safe Depth-Limited Solving With Diverse Opponents for Imperfect-Information Games · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.11580/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2201.11580/feed.xml" rel="self" type="application/rss+xml" /><item><title>DecisionHoldem: Safe Depth-Limited Solving With Diverse Opponents for Imperfect-Information Games — mentioned by energy_floww</title><link>https://news.ycombinator.com/item?id=45875451</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.11580:45875451</guid><pubDate>Mon, 10 Nov 2025 12:50:35 GMT</pubDate><description>&lt;p&gt;Curious about the current state of poker bots in 2025—especially for Texas Hold’em cash games (HU/6-max). - What architectures/approaches are strong today (e.g., CFR/MCCFR, depth-limited solving, GTO vs exploitative, RL with abstractions)? - Any public benchmarks, ladders, or eval suites people trust? - Practical experiences running or testing against bots (e.g., Slumbot)? Any reproducible open-source projects you recommend? - How do folks think about ethics and platform policies around botting in real-money environments? - If you’ve built one: which libraries, hardware, and datasets were…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.11580/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
