<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Limits of Rush Hour Logic Complexity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0502068/</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/cs_0502068/feed.xml" rel="self" type="application/rss+xml" /><item><title>Limits of Rush Hour Logic Complexity — mentioned by tromp</title><link>https://news.ycombinator.com/item?id=42044727</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0502068:42044727</guid><pubDate>Mon, 04 Nov 2024 18:42:59 GMT</pubDate><description>&lt;p&gt;The database has the hardest 6x6 Rush hour level taking 51 moves. This goes up significantly if we make all cars to be 1x1 unit sized but each one restricted to either horizontal or vertical movement. Then the hardest 6x6 level takes a whopping 732 moves! [1] [1] https://arxiv.org/abs/cs/0502068&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0502068/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item><item><title>Limits of Rush Hour Logic Complexity — mentioned by tromp</title><link>https://news.ycombinator.com/item?id=38331873</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0502068:38331873</guid><pubDate>Sun, 19 Nov 2023 12:05:34 GMT</pubDate><description>&lt;p&gt;If you reduce cars to a length of just 1, you get Unit Rush Hour, which turns out to be much harder [1]. Thew hardest 6x6 instance takes 732 moves to solve! Unit Rush Hour can also be viewed as a maze with a certain orientation rule. On my orimaze page you can try playing the hardest 4x4 and 5x5 instances in your browser. [1] https://arxiv.org/abs/cs/0502068 [2] https://tromp.github.io/orimaze.html&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0502068/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
