<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Constraint-Propagation on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/constraint-propagation/</link><description>Recent content in Constraint-Propagation on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:20:25 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/constraint-propagation/index.xml" rel="self" type="application/rss+xml"/><item><title>Hashiwokakero (Bridges) Solver</title><link>https://abaj.ai/wiki/ai/csp/hashiwokakero/</link><pubDate>Fri, 10 Jul 2026 08:09:53 +1000</pubDate><guid>https://abaj.ai/wiki/ai/csp/hashiwokakero/</guid><description>&lt;p>hashiwokakero (&amp;ldquo;build bridges&amp;rdquo;, nikoli) hands you a grid of numbered islands and asks you to join them with bridges until every number is spent. it is the friendliest possible introduction to constraint satisfaction: the constraints are few and visual, propagation alone solves most human-published puzzles, and when it doesn&amp;rsquo;t, you get to write a backtracking search. this page documents my solver at &lt;code>code/private/hashi/&lt;/code> — a go rewrite of a uni assignment originally in c — including the debugging session that writing this page forced on it.&lt;span class="margin-note" data-note="the repo&amp;#39;s own README opens with a life lesson: &amp;#39;whenever you port code, make sure it is correct before translating otherwise you will introduce a suicidal amount of bugs.&amp;#39; foreshadowing.">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>
&lt;/p></description></item></channel></rss>