<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tile Pattern KL-Divergence for Analysing and Evolving Game Levels · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.05077/</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/1905.05077/feed.xml" rel="self" type="application/rss+xml" /><item><title>Tile Pattern KL-Divergence for Analysing and Evolving Game Levels — mentioned by abetusk</title><link>https://news.ycombinator.com/item?id=37223844</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.05077:37223844</guid><pubDate>Tue, 22 Aug 2023 15:07:40 GMT</pubDate><description>&lt;p&gt;Intuitively, it measures the difference between two probability distributions. It&amp;#x27;s not symmetric, so it&amp;#x27;s not quite that, but in my opinion, it&amp;#x27;s good intuition. As motivation, say you&amp;#x27;re an internet provider, providing internet service to a business. You naturally want to save money, so you perhaps want to compress packets before they go over the wire. Let&amp;#x27;s say the business you&amp;#x27;re providing service to also compresses their data, but they&amp;#x27;ve made a mistake and do it inefficiently. Let&amp;#x27;s say the business has, incorrectly, determined the probability distribution for their data to be $q(x)$.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.05077/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
