<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="/atom.xsl"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Mitchell Is Typing</title>
  
  <link href="https://mvr.github.io/atom.xml" rel="self" />
  <link href="https://mvr.github.io" />
  <id>urn:uuid:84a94671-fda4-46c5-a91f-c9188dc0ee67</id>
  <updated>2026-10-26T00:00:00Z</updated>
  <author>
    <name>Mitchell Riley</name>
    
    <email>mitchell.v.riley@gmail.com</email>
    
  </author>
    <entry>
    <title>Profunctor Learners</title>
    <link href="https://mvr.github.io/posts/profunctor-learners.html" rel="alternate" />
    <id>urn:uuid:a3d22a7c-7cb6-5de1-956c-b417bfa3e8de</id>
    
    <published>2026-10-26T00:00:00Z</published>
    
    <updated>2026-10-26T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[<p><a href="https://arxiv.org/abs/1809.00738">Optics</a> have a very nice
formulation used in some
<a href="https://hackage.haskell.org/package/optics">Haskell</a> (and
<a href="https://pursuit.purescript.org/packages/purescript-profunctor-lenses/8.0.0">PureScript</a>!)
libraries; the so-called “profunctor representation”. Learners,
defined a <a href="https://doi.org/10.4204/eptcs.429.3">certain way</a>, look an
awful lot like some kind of two-sided or symmetric optic. Let’s see if
we can devise a profunctor representation for them. This post was
prompted by a chat with <a href="https://bartoszmilewski.com/">Bartosz Milewski</a>.</p><p><a href="/posts/profunctor-learners.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>No‑Three‑In‑Line, Rarer</title>
    <link href="https://mvr.github.io/posts/no-three-in-line-rarer.html" rel="alternate" />
    <id>urn:uuid:ff2f05b1-92fb-5550-aea5-88d1e7fc1aa5</id>
    
    <published>2026-10-15T00:00:00Z</published>
    
    <updated>2026-10-15T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[
<p>There has been a lot of progress since my <a href="/posts/no-three-in-line-dumber.html">last update</a>, catalogued on Achim Flammenkamp’s <a href="https://wwwhomes.uni-bielefeld.de/achim/no3in/readme.html">page</a>. Most notably, <a href="https://www.cs.cmu.edu/~mheule/">Marijn Heule</a> has come out of nowhere and smashed the size records using a new SAT solver; the record now stands at 76×76 (with four-fold rotational symmetry).</p>
<p>As for my GPU code, there hasn’t been any change there, just running it on larger systems for a longer time. One interesting result: the unique 47×47 solution with four-fold diagonal symmetry, displayed below. <a href="https://webspace.maths.qmul.ac.uk/t.prellberg/">Thomas Prellberg</a> has continued the search up to 57×57, but there hasn’t been another. Could this be the last in the symmetry class?</p>
<p>[diagram]</p><p><a href="/posts/no-three-in-line-rarer.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>“We” is Other People</title>
    <link href="https://mvr.github.io/posts/we-is-other-people.html" rel="alternate" />
    <id>urn:uuid:467f9e6b-4248-5fdb-b324-ac7689642c56</id>
    
    <published>2026-08-05T00:00:00Z</published>
    
    <updated>2026-08-05T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[<p>There’s a pattern I’ve seen more and more in political commentary,
especially the Australian sources I pay attention to, where someone
will make a sweeping diagnosis of a social problem in the language of
things that <em>we</em> do wrong.</p><p><a href="/posts/we-is-other-people.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>Geometric Type Theory, Done Two Ways</title>
    <link href="https://mvr.github.io/posts/geometric-type-theory.html" rel="alternate" />
    <id>urn:uuid:bb2446ab-0114-5e80-b360-c8da988fdbaa</id>
    
    <published>2026-06-16T00:00:00Z</published>
    
    <updated>2026-06-16T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[<p>I have a <a href="https://topos.institute/blog/2026-06-15-geometric-type-theory-done-two-ways/">new
post</a>
on the Topos blog.</p>
<blockquote>
<p>A topos can be specified by the geometric theory that it
classifies. Though the sequents of a theory are described formally
and syntactically, its interaction with the world of sets (through
set-indexed disjunctions and axiom schemas) is often a little
hand-wavy. In this post I describe two ways of doing this more
precisely using type theory.</p>
</blockquote><p><a href="/posts/geometric-type-theory.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>Constraining the Period of Officers</title>
    <link href="https://mvr.github.io/posts/officers-sat.html" rel="alternate" />
    <id>urn:uuid:be5e1906-9213-56c9-a90e-b56479995380</id>
    
    <published>2026-03-23T00:00:00Z</published>
    
    <updated>2026-03-23T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[<p>The values of the impartial game <a href="/posts/officers.html">Officers</a> are probably periodic
eventually. Can we say anything about what the period could be?</p><p><a href="/posts/officers-sat.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>No‑Three‑In‑Line, Dumber</title>
    <link href="https://mvr.github.io/posts/no-three-in-line-dumber.html" rel="alternate" />
    <id>urn:uuid:3096047d-0840-5efd-bb46-e9fa91ca8b7c</id>
    
    <published>2026-03-15T00:00:00Z</published>
    
    <updated>2026-03-15T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[
<p>(<a href="/posts/no-three-in-line.html">Previously</a>, <a href="/posts/no-three-in-line-quicker.html">previously</a>)</p>
<p>To not bury the lede, we finally have our first new value for the OEIS
sequence <a href="https://oeis.org/A000769">A000769</a> (and its corollary
<a href="https://oeis.org/A000755">A000755</a>):</p>
<p><span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><mi>a</mi><mo stretchy="false">(</mo><mn>19</mn><mo stretchy="false">)</mo><mo>=</mo><mn>32577</mn></mrow><annotation encoding="application/x-tex"> a(19) = 32577 </annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathnormal">a</span><span class="mopen">(</span><span class="mord">19</span><span class="mclose">)</span><span class="mspace" style="margin-right:0.2778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em;"></span></span><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">32577</span></span></span></span></span></p>
<p>This was calculated in 255 GPU-hours using eight RTX 4090s rented from
<a href="https://www.runpod.io/">Runpod</a>.</p>
<p>Not only that! With help from <a href="https://webspace.maths.qmul.ac.uk/t.prellberg/">Thomas Prellberg</a> and the <a href="https://docs.hpc.qmul.ac.uk/">GPU cluster</a>
at Queen Mary University of London, we’ve been able to find some
solutions with record-breaking sizes. The largest at the time I’m
writing this is 64×64, shown below, with hopefully more on the way.</p>
<p>[diagram]</p><p><a href="/posts/no-three-in-line-dumber.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>What Makes Tametsi So Satisfying?</title>
    <link href="https://mvr.github.io/posts/tametsi.html" rel="alternate" />
    <id>urn:uuid:0251b026-9180-5b8c-8c98-2e0b68284d4a</id>
    
    <published>2026-01-19T00:00:00Z</published>
    
    <updated>2026-01-19T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[<p>For the last month I’ve been completely addicted to the logic puzzle
game <a href="https://store.steampowered.com/app/709920/Tametsi/">Tametsi</a>. Put briefly, it’s ordinary <a href="https://en.wikipedia.org/wiki/Minesweeper_(video_game)">Minesweeper</a> but with a
set of 160 hand-crafted puzzles rather than a randomly generated
starting board. Beyond the Minesweeper rules that we’re all familiar
with, there are only a couple of additions: non-square/irregular grids
for many of the puzzles, and “global” constraints, such as a fixed
number of mines in cells of a particular colour or along a specified
line.</p>
<p>I finally finished all the available puzzles and so Tametsi has
released its grip on me. I’ve been trying to figure out what made it
so compelling, and here’s the best I could come up with.</p><p><a href="/posts/tametsi.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>All 23-Bit Still Lifes Are Glider Constructible</title>
    <link href="https://mvr.github.io/posts/xs23.html" rel="alternate" />
    <id>urn:uuid:ea29baf2-f143-5c5c-aa91-4381bec7b7fb</id>
    
    <published>2025-12-27T00:00:00Z</published>
    
    <updated>2025-12-27T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[
<p>In the Game of Life, which still lifes can be produced by crashing
gliders together? We’ve known for a few years that the answer cannot
be “all of them”, because in 2022 Ilkka Törmä and Ville Salo <a href="https://conwaylife.com/forums/viewtopic.php?p=140258#p140258">found</a> a
patch of still life that, if it exists in the universe, must have
existed since the beginning of time. And so, there is no way we could
have produced it out of empty space through glider collisions. Similar
such patches have been found since, with the goal of optimising size
or population, and at the time of writing the <a href="https://conwaylife.com/forums/viewtopic.php?f=2&amp;t=6830#p209209">record holder</a> is an
unsynthesizable still life with population 154 produced by forum user
“400spartans”.</p>
<p>Finding syntheses for small still lifes is easy, but at some unknown
point below 154 it becomes impossible. Today, we completed our
collaborative project to notch the lower bound up from 22 to 23, by
giving explicit syntheses for all 1,646,147 (strict) still lifes with population 23.</p><p><a href="/posts/xs23.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>No‑Three‑In‑Line, Quicker</title>
    <link href="https://mvr.github.io/posts/no-three-in-line-quicker.html" rel="alternate" />
    <id>urn:uuid:8d52f56f-48bf-5f2f-b079-f4ef06a2fb20</id>
    
    <published>2025-09-30T00:00:00Z</published>
    
    <updated>2025-09-30T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[
<p>The code in the <a href="/posts/no-three-in-line.html">previous post</a> is
fairly quick, but of course we’d always prefer it to be quicker. I’ll
keep a record here of things I’ve tried and whether they worked.</p><p><a href="/posts/no-three-in-line-quicker.html">&gt; Read Post</a></p>]]></summary>
  </entry>
  <entry>
    <title>No‑Three‑In‑Line</title>
    <link href="https://mvr.github.io/posts/no-three-in-line.html" rel="alternate" />
    <id>urn:uuid:16f67ad5-725b-5b24-b4cd-d24958a1723a</id>
    
    <published>2025-09-01T00:00:00Z</published>
    
    <updated>2025-09-01T00:00:00Z</updated>
    <author>
      <name>Mitchell Riley</name>
      
      <email>mitchell.v.riley@gmail.com</email>
      
    </author>
    <summary type="html"><![CDATA[
<p>The <a href="https://en.wikipedia.org/wiki/No-three-in-line_problem">No-three-in-line
problem</a> asks
how many points can be placed on a <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow><annotation encoding="application/x-tex">n \times n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6667em;vertical-align:-0.0833em;"></span><span class="mord mathnormal">n</span><span class="mspace" style="margin-right:0.2222em;"></span><span class="mbin">×</span><span class="mspace" style="margin-right:0.2222em;"></span></span><span class="base"><span class="strut" style="height:0.4306em;"></span><span class="mord mathnormal">n</span></span></span></span> grid so that no three
points are on the same line, where the lines considered are of any
slope and not just orthogonal and diagonal. Each row/column can
contain at most 2 points, so clearly the answer is at most <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2</mn><mi>n</mi></mrow><annotation encoding="application/x-tex">2n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">2</span><span class="mord mathnormal">n</span></span></span></span>. The
real question is, can we actually achieve <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2</mn><mi>n</mi></mrow><annotation encoding="application/x-tex">2n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">2</span><span class="mord mathnormal">n</span></span></span></span> for every grid size?
It’s <a href="https://doi.org/10.4153%2FCMB-1968-062-3">conjectured</a> that the
answer is “no” for grids large enough, but we don’t know where the
crossover point is and there’s <a href="http://web.archive.org/web/20131027174807/http://wso.williams.edu/~bchaffin/no_three_in_line/index.htm">no
indication</a>
that the number of <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>2</mn><mi>n</mi></mrow><annotation encoding="application/x-tex">2n</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">2</span><span class="mord mathnormal">n</span></span></span></span>-point solutions is falling away from
exponential growth, at least up to <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>18</mn><mo>×</mo><mn>18</mn></mrow><annotation encoding="application/x-tex">18 \times 18</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em;"></span><span class="mord">18</span><span class="mspace" style="margin-right:0.2222em;"></span><span class="mbin">×</span><span class="mspace" style="margin-right:0.2222em;"></span></span><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">18</span></span></span></span>!</p>
<p>To my eye, the configurations that work can be quite balanced and
attractive. Here are some symmetrical ones for <span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mn>14</mn><mo>×</mo><mn>14</mn></mrow><annotation encoding="application/x-tex">14 \times 14</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7278em;vertical-align:-0.0833em;"></span><span class="mord">14</span><span class="mspace" style="margin-right:0.2222em;"></span><span class="mbin">×</span><span class="mspace" style="margin-right:0.2222em;"></span></span><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">14</span></span></span></span> (though
in general the solutions are not necessarily symmetric in this way):</p>
<p>[diagram]</p>
<p>The most extensive searches for configurations so far have been done
by <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/readme.html">Achim
Flammenkamp</a>
and later by <a href="https://benchaffin.com/">Ben Chaffin</a>. I’ve <a href="https://github.com/mvr/no-three-in-line">written
some CUDA code</a> of my
own with the goal of pushing things a little further, and I’ll explain
it in the rest of this post.</p><p><a href="/posts/no-three-in-line.html">&gt; Read Post</a></p>]]></summary>
  </entry>

</feed>
