<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Digital Red Queen: Adversarial Program Evolution in Core War with LLMs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2601.03335/</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/2601.03335/feed.xml" rel="self" type="application/rss+xml" /><item><title>Digital Red Queen: Adversarial Program Evolution in Core War with LLMs — mentioned by hardmaru</title><link>https://news.ycombinator.com/item?id=46542770</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.03335:46542770</guid><pubDate>Thu, 08 Jan 2026 16:17:29 GMT</pubDate><description>&lt;p&gt;Hi HN, I am one of the authors from Sakana AI and MIT. We just released this paper where we hooked up LLMs to the classic 1984 programming game Core War. For those who haven&amp;#x27;t played it, Core War involves writing assembly programs in a language called Redcode that battle for control of a virtual computer&amp;#x27;s memory. You win by crashing the opponent&amp;#x27;s process while keeping yours running. It is a Turing-complete environment where code and data share the same address space, which leads to some very chaotic self-modifying code dynamics. We did not just ask the model to write winning code from…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.03335/"&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>
