<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Exact-Cover on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/exact-cover/</link><description>Recent content in Exact-Cover 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/exact-cover/index.xml" rel="self" type="application/rss+xml"/><item><title>Sudoku</title><link>https://abaj.ai/wiki/ai/csp/sudoku/</link><pubDate>Fri, 10 Jul 2026 07:43:56 +1000</pubDate><guid>https://abaj.ai/wiki/ai/csp/sudoku/</guid><description>&lt;p>sudoku is the drosophila of constraint satisfaction: small enough to hold in your head, rich enough to demonstrate every solving paradigm that matters. this page works through four of them against my actual code — a backtracking solver with \(O(1)\) constraint sets (&lt;code>arcade/references/sudoku/solver.py&lt;/code>), a dart port that also &lt;em>generates&lt;/em> puzzles (arcade-mobile), an integer-programming formulation solved for real with scipy, and the exact-cover view that leads to knuth&amp;rsquo;s algorithm x. every timing below is a real run on this machine.&lt;/p></description></item></channel></rss>