<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lion and Man -- Can Both Win? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0909.2524/</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/0909.2524/feed.xml" rel="self" type="application/rss+xml" /><item><title>Lion and Man -- Can Both Win? — mentioned by ultrafilter</title><link>https://news.ycombinator.com/item?id=6076514</link><guid isPermaLink="false">urn:hackerpapers:mention:0909.2524:6076514</guid><pubDate>Sat, 20 Jul 2013 20:47:11 GMT</pubDate><description>&lt;p&gt;The man&amp;#x27;s escape strategy described in the post was discovered in 1952 by Besicovitch. It has a kind of discontinuity because, quoting the post, &amp;quot;There are 2 perpendicular paths. Choose the one closest to the center, or if the two paths are equally close, then either one is fine.&amp;quot; In simple terms, the man will eventually make a wrong turn (with probability 1) unless he can instantaneously measure distances with perfect accuracy. Surprisingly, for every continuous man strategy, there is a continuous lion strategy that can catch the man by time T where T is the disc radius divided by the lion&amp;#x27;s…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0909.2524/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.OC</category></item><item><title>Lion and Man -- Can Both Win? — mentioned by tylerneylon</title><link>https://news.ycombinator.com/item?id=3616850</link><guid isPermaLink="false">urn:hackerpapers:mention:0909.2524:3616850</guid><pubDate>Tue, 21 Feb 2012 15:48:50 GMT</pubDate><description>&lt;p&gt;This is a problem you can be sure you&amp;#x27;ve solved, only to find a twist in the road. It&amp;#x27;s problem 1 in The Art of Mathematics by Béla Bollobás, a challenging puzzle book for serious math junkies. The solution in that book has a good explanation of (a) what you probably didn&amp;#x27;t think of, and sounds right; and (b) why it&amp;#x27;s wrong. And just when you think Bollobás&amp;#x27;s book had the final word, you found out there are versions of the puzzle when both players can win. What? Don&amp;#x27;t take my word for it: http://arxiv.org/pdf/0909.2524.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0909.2524/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.OC</category></item></channel></rss>
