<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Transfinite game values in infinite chess · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1302.4377/</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/1302.4377/feed.xml" rel="self" type="application/rss+xml" /><item><title>Transfinite game values in infinite chess — mentioned by cvoss</title><link>https://news.ycombinator.com/item?id=33371755</link><guid isPermaLink="false">urn:hackerpapers:mention:1302.4377:33371755</guid><pubDate>Fri, 28 Oct 2022 14:26:39 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re like me and got very excited by teasers like this: &amp;gt; Another interesting thing we noticed is that there is a computable position in infinite chess, such that ... white has a computable strategy defeating any computable strategy of black—but in the category of arbitrary play, both players have a drawing strategy. ...then here is the original paper, where they go into much more detail: https://arxiv.org/pdf/1302.4377.pdf It sounds absolutely fascinating, and I want to learn more.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1302.4377/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item></channel></rss>
