<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Implicit Search via Discrete Diffusion: A Study on Chess · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.19805/</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/2502.19805/feed.xml" rel="self" type="application/rss+xml" /><item><title>Implicit Search via Discrete Diffusion: A Study on Chess — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=49003883</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.19805:49003883</guid><pubDate>Wed, 22 Jul 2026 09:21:12 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s a direct quotation from your comment, not a &amp;quot;scare quote&amp;quot;. How does &amp;quot;implicit search&amp;quot; do pruning? Can you explain? Edit: Turns out &amp;quot;implicit search&amp;quot; is actually a thing in the literature, albeit introduced in a single paper I could find that claims Diffusion Modelling does it: https://arxiv.org/abs/2502.19805 I don&amp;#x27;t think anyone has picked that term up. One more for the scrapheap then, oh well, next paper. No mention of pruning though. So what did you, or the other guys mean?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.19805/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
