<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1712.01815/</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/1712.01815/feed.xml" rel="self" type="application/rss+xml" /><item><title>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by dmurray</title><link>https://news.ycombinator.com/item?id=43877403</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:43877403</guid><pubDate>Sat, 03 May 2025 07:19:16 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s exactly at the level I thought was communicated by the title and introduction. &amp;quot;Human level competitive&amp;quot;, &amp;quot;solidly amateur-level human performance&amp;quot;, &amp;quot;beat 100% of beginners and 55% of intermediate players&amp;quot;. That robot would definitely win some games in your local club league, except that it doesn&amp;#x27;t serve, and unless it&amp;#x27;s cheating in ways the announcement glosses over like extra cameras - DeepMind have some history here so I reserve the right to be skeptical. The only thing I&amp;#x27;d take issue with in the abstract is &amp;quot;Table tennis... requires human players to undergo years of training to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by dargscisyhp</title><link>https://news.ycombinator.com/item?id=36848847</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:36848847</guid><pubDate>Mon, 24 Jul 2023 14:43:11 GMT</pubDate><description>&lt;p&gt;I thought the AlphaZero paper was pretty cool: https://arxiv.org/abs/1712.01815 Not only did we get a whole new type of Chess engine, it was also interesting to see how the engine thought of different openings at various stages in its training. For instance, the Caro-Kann, which is my weapon of choice, was favored quite heavily by it for several hours and then seemingly rejected (perhaps it even refuted it?!) near the end.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by sillysaurusx</title><link>https://news.ycombinator.com/item?id=35484186</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:35484186</guid><pubDate>Fri, 07 Apr 2023 17:17:55 GMT</pubDate><description>&lt;p&gt;According to the AlphaZero paper (https://arxiv.org/pdf/1712.01815.pdf) they ran game logic on TPUs: &amp;gt; Training proceeded for 700,000 steps (mini-batches of size 4,096) starting from randomly initialised parameters, using 5,000 first-generation TPUs to generate self-play games and 64 second-generation TPUs to train the neural networks. Further details of the training procedure are provided in the Methods.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by SideQuark</title><link>https://news.ycombinator.com/item?id=34895837</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:34895837</guid><pubDate>Wed, 22 Feb 2023 14:16:09 GMT</pubDate><description>&lt;p&gt;&amp;gt;alphazero&amp;#x27;s loss function never changed Yes, it did. Alpha zero&amp;#x27;s loss function changes with every update. The loss function works on the actual outcome versus the predicted outcome, and the predicted outcome is a result of previous learning. So with every step it takes, which are random (and the initial weights are also random), it modifies it&amp;#x27;s own loss function for future walks in the space of weights. Rerun the entire training with different initial random weights, and look at the sequence of loss functions, and you will get a different sequence. The paper…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by tastroder</title><link>https://news.ycombinator.com/item?id=21533705</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:21533705</guid><pubDate>Thu, 14 Nov 2019 08:13:25 GMT</pubDate><description>&lt;p&gt;Not working in this area but the abstract of the AlphaZero paper [0] seems to disagree about your /any prior knowledge/ point: &amp;quot;Starting from random play, and given no domain knowledge except the game rules, AlphaZero achieved within 24 hours a superhuman level of play in the games of chess and shogi (Japanese chess) as well as Go, and convincingly defeated a world-champion program in each case.&amp;quot; [0] https://arxiv.org/abs/1712.01815&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by tim333</title><link>https://news.ycombinator.com/item?id=17186373</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:17186373</guid><pubDate>Wed, 30 May 2018 09:50:18 GMT</pubDate><description>&lt;p&gt;The results were published - https://arxiv.org/abs/1712.01815 I agree AlphaZero had fancier hardware and so it wasn&amp;#x27;t really a fair fight.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=16459678</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:16459678</guid><pubDate>Sun, 25 Feb 2018 16:34:30 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s a vector encoding &amp;quot;queen moves&amp;quot; and another encoding &amp;quot;knight moves&amp;quot;. Between them, they cover all possible chess moves. Knight moves obviously are modelled by &amp;quot;knight moves&amp;quot;. Edit: https://arxiv.org/pdf/1712.01815.pdf The information you want is on page 13, last paragraph. The previous paragraph describes the representation of the boardd.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by yorwba</title><link>https://news.ycombinator.com/item?id=16365359</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:16365359</guid><pubDate>Tue, 13 Feb 2018 07:28:03 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m curious why you believe to be able to tell that my comment is not accurate when you yourself admit that you have no idea about deep learning? Note that I&amp;#x27;m not saying that Google is doing something stupid or leaving potential gains on the table. What I&amp;#x27;m saying is that their methods make sense when you are able to perform enough experiments to actually make data-driven decisions. There is just no way to emulate that when you don&amp;#x27;t even have the budget to try more than one value for some hyperparameters. And since you mentioned chess: The paper https://arxiv.org/pdf/1712.01815.pdf doesn&amp;#x27;t…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by nealeratzlaff</title><link>https://news.ycombinator.com/item?id=16056640</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:16056640</guid><pubDate>Tue, 02 Jan 2018 22:53:55 GMT</pubDate><description>&lt;p&gt;I think for most people that hurdle of understanding is immense, and isn&amp;#x27;t likely to get any better. ML/DL infrastructure will continue to improve and deploying AI systems will become more accessible as time goes on. But I don&amp;#x27;t see familiarity with (non) convex optimization, statistical learning, topology, etc. becoming mainstream. Without these its hard to see a reasonable path forward for AI. For me this year in DL was a lot narrower. it mostly revolved around systems becoming more human in capability. I think most of this is in the article already: We can now hopefully say that ImageNet…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by beefman</title><link>https://news.ycombinator.com/item?id=16037058</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:16037058</guid><pubDate>Sat, 30 Dec 2017 19:42:37 GMT</pubDate><description>&lt;p&gt;Programming languages Slepak et al - An Array-Oriented Language with Static Rank Polymorphism [1] Distributed systems Kiayias et al - A Provably Secure Proof-of-Stake Blockchain Protocol [2] Cognitive computing Boahen - A Neuromorph&amp;#x27;s Prospectus [3] Machine learning Silver et al - Mastering Chess and Shogi [4] 1 http://www.ccs.neu.edu/home/shivers/papers/rank-polymorphism... 2 https://eprint.iacr.org/2016/889.pdf 3 https://pdfs.semanticscholar.org/3767/1e53c9949fa08d9dc150ad... 4 https://arxiv.org/pdf/1712.01815.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by vatueil</title><link>https://news.ycombinator.com/item?id=15928768</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:15928768</guid><pubDate>Fri, 15 Dec 2017 00:31:47 GMT</pubDate><description>&lt;p&gt;Interesting information on reasons for choosing a 1GB hash size, thanks. &amp;gt; A0 should have let Stockfish use its opening book though. Has it been confirmed that it didn&amp;#x27;t? As far as I can tell, DeepMind never said that Stockfish didn&amp;#x27;t use an opening book or endgame tablebase, only that AlphaZero didn&amp;#x27;t: https://twitter.com/demishassabis/status/938347604462542849 The only time opening books are mentioned in the arxiv paper is when they are described as standard components of chess engines; while it doesn&amp;#x27;t explicitly state whether Stockfish was allowed to use them in the tests, I would think…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by wrsh07</title><link>https://news.ycombinator.com/item?id=15875013</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:15875013</guid><pubDate>Thu, 07 Dec 2017 22:33:42 GMT</pubDate><description>&lt;p&gt;The arxiv paper is here: https://arxiv.org/abs/1712.01815&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by heliumcraft</title><link>https://news.ycombinator.com/item?id=15869850</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:15869850</guid><pubDate>Thu, 07 Dec 2017 13:40:49 GMT</pubDate><description>&lt;p&gt;You can see that on page 7 of the paper https://arxiv.org/pdf/1712.01815.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — mentioned by bfirsh</title><link>https://news.ycombinator.com/item?id=15859924</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.01815:15859924</guid><pubDate>Wed, 06 Dec 2017 10:08:15 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s an HTML version of the paper: https://www.arxiv-vanity.com/papers/1712.01815/ Table 2 is broken, but the rest is much more readable if you&amp;#x27;re on a phone.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm — HN submission</title><link>https://news.ycombinator.com/item?id=15858197</link><guid isPermaLink="false">urn:hackerpapers:submission:1712.01815:15858197</guid><pubDate>Wed, 06 Dec 2017 03:17:22 GMT</pubDate><description>&lt;p&gt;Mastering Chess and Shogi by Self-Play with General Reinforcement Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;539 points; 270 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1712.01815/"&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>
