<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Student of Games: A unified learning algorithm for both perfect and imperfect information games · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.03178/</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/2112.03178/feed.xml" rel="self" type="application/rss+xml" /><item><title>Student of Games: A unified learning algorithm for both perfect and imperfect information games — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=38713704</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.03178:38713704</guid><pubDate>Wed, 20 Dec 2023 21:11:15 GMT</pubDate><description>&lt;p&gt;The standard AlphaZero doesn&amp;#x27;t handle that. For that you&amp;#x27;d need to graduate to more complex variants like the aforementioned ReBeL, AlphaZe* https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10213697/ or BetaZero https://arxiv.org/abs/2306.00249 or ExIt-OOS https://arxiv.org/abs/1808.10120 or Player of Games https://arxiv.org/abs/2112.03178#deepmind . (You could also move straight to MuZero variations: https://arxiv.org/abs/2106.04615#deepmind https://openreview.net/forum?id=X6D9bAHhBQ1#deepmind https://openreview.net/forum?id=QnzSSoqmAvB )&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.03178/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Student of Games: A unified learning algorithm for both perfect and imperfect information games — mentioned by thomasahle</title><link>https://news.ycombinator.com/item?id=32063563</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.03178:32063563</guid><pubDate>Mon, 11 Jul 2022 23:32:43 GMT</pubDate><description>&lt;p&gt;Bayesian play is not necessarily optimal for imperfect information games. The reason is: You don&amp;#x27;t only need to play optimally with respect to the information you have observed, you also need to hide your own information and balance those two needs. See the Deep Mind &amp;quot;Player of Games&amp;quot; paper from last year for an agent that takes a more game theoretic approach, which is probably needed for &amp;quot;simpler&amp;quot; games like Poker, that we can play to higher levels of accuracy: https://arxiv.org/pdf/2112.03178.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.03178/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Student of Games: A unified learning algorithm for both perfect and imperfect information games — mentioned by splonk</title><link>https://news.ycombinator.com/item?id=29986947</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.03178:29986947</guid><pubDate>Tue, 18 Jan 2022 22:24:50 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s a recent paper from DeepMind about their recent efforts towards generalized game solving (caveat: I haven&amp;#x27;t actually read it yet). https://arxiv.org/pdf/2112.03178.pdf Abstract: &amp;quot;Games have a long history of serving as a benchmark for progress in artificial intelligence. Recently, approaches using search and learning have shown strong performance across a set of perfect information games, and approaches using game-theoretic reasoning and learning have shown strong performance for specific imperfect information poker variants. We introduce Player of Games, a general-purpose algorithm…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.03178/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Student of Games: A unified learning algorithm for both perfect and imperfect information games — HN submission</title><link>https://news.ycombinator.com/item?id=29481665</link><guid isPermaLink="false">urn:hackerpapers:submission:2112.03178:29481665</guid><pubDate>Wed, 08 Dec 2021 05:52:14 GMT</pubDate><description>&lt;p&gt;Player of Games&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;364 points; 231 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2112.03178/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
