<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Riddle on Lomont.org</title>
		<link>https://www.lomont.org/tags/riddle/</link>
		<description>Recent content in Riddle on Lomont.org</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
		
		
		
			<lastBuildDate>Fri, 26 Jul 2024 07:50:18 -0400</lastBuildDate>
		
			<atom:link href="https://www.lomont.org/tags/riddle/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>MinimalTicTacToe</title>
				<link>https://www.lomont.org/posts/2024/minimaltictactoe/</link>
				<pubDate>Fri, 26 Jul 2024 07:50:18 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2024/minimaltictactoe/</guid>
				<description>&lt;!--summary--&gt;&#xD;&#xA;&lt;p&gt;Derivation of a minimal size tree for playing perfect tic tac toe&lt;/p&gt;</description>
			</item>
			<item>
				<title>Chris Lomont&#39;s Riddle Pages</title>
				<link>https://www.lomont.org/riddles/how-many-prisoners/</link>
				<pubDate>Thu, 06 Jun 2019 07:55:47 -0400</pubDate>
				<guid>https://www.lomont.org/riddles/how-many-prisoners/</guid>
				<description>&lt;p&gt;Summary&lt;/p&gt;</description>
			</item>
			<item>
				<title>Chris Lomont&#39;s Riddle Pages</title>
				<link>https://www.lomont.org/riddles/prisoners-in-limbo/</link>
				<pubDate>Thu, 06 Jun 2019 07:55:47 -0400</pubDate>
				<guid>https://www.lomont.org/riddles/prisoners-in-limbo/</guid>
				<description>&lt;p&gt;Summary&lt;/p&gt;</description>
			</item>
			<item>
				<title>Walking Ant Probability Problem</title>
				<link>https://www.lomont.org/posts/2017/walking-ant/</link>
				<pubDate>Wed, 01 Nov 2017 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/walking-ant/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s a math puzzle.&lt;/p&gt;</description>
			</item>
			<item>
				<title>A Universal FRACTRAN Interpreter in FRACTRAN</title>
				<link>https://www.lomont.org/posts/2017/fractran/</link>
				<pubDate>Mon, 01 May 2017 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/fractran/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s FRACTRAN, a weird fraction based programming language, written in FRACTRAN.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Making Three NOT Gates from Two</title>
				<link>https://www.lomont.org/posts/2017/making-three-not-gates/</link>
				<pubDate>Sat, 17 Sep 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2017/making-three-not-gates/</guid>
				<description>&lt;p&gt;This is a hard puzzle about using two NOT gates to build three.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Average segment length</title>
				<link>https://www.lomont.org/posts/2016/random-segment-length/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/random-segment-length/</guid>
				<description>&lt;p&gt;What&amp;rsquo;s the average length of a segment chosen uniformly by area on a unit square?&lt;/p&gt;</description>
			</item>
			<item>
				<title>How many prisoners?</title>
				<link>https://www.lomont.org/posts/2016/how-many-prisoners/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/how-many-prisoners/</guid>
				<description>&lt;p&gt;This is a nicely hard problem in the common prisoners and warden format.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Pick a Number</title>
				<link>https://www.lomont.org/posts/2016/pick-a-number/</link>
				<pubDate>Tue, 23 Aug 2016 17:08:08 -0400</pubDate>
				<guid>https://www.lomont.org/posts/2016/pick-a-number/</guid>
				<description>&lt;p&gt;Here&amp;rsquo;s a result that is completely non-intuitive.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
