<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Haskell on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/haskell/</link><description>Recent content in Haskell on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:15:43 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/haskell/index.xml" rel="self" type="application/rss+xml"/><item><title>Banagrams Solver</title><link>https://abaj.ai/wiki/csp/banagrams/</link><pubDate>Fri, 10 Jul 2026 07:44:19 +1000</pubDate><guid>https://abaj.ai/wiki/csp/banagrams/</guid><description>&lt;p>bananagrams hands you a fistful of letter tiles and one instruction: arrange &lt;em>all&lt;/em> of them into a connected crossword before anyone else does.&lt;span class="margin-note" data-note="the game ships as a banana-shaped bag of 144 tiles, hence the name. no board, no scores, no turns — first to use every tile shouts bananas and wins">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

this page documents the real solver living in this repo at &lt;code>static/code/bananagrams/&lt;/code> — a haskell heuristic search in &lt;code>haskell-imp/&lt;/code> plus a playable js incarnation served at &lt;code>/code/bananagrams/&lt;/code> on this site — rather than a from-scratch design; a compact python reference solver (trie + backtracking) is developed at the end to make the algorithmic skeleton explicit.&lt;/p></description></item></channel></rss>