<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Global-Constraints on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/global-constraints/</link><description>Recent content in Global-Constraints 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:51 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/global-constraints/index.xml" rel="self" type="application/rss+xml"/><item><title>Constraint</title><link>https://abaj.ai/wiki/ccs/programming/paradigms/constraint/</link><pubDate>Fri, 10 Jul 2026 07:43:56 +1000</pubDate><guid>https://abaj.ai/wiki/ccs/programming/paradigms/constraint/</guid><description>&lt;p>constraint programming inverts the usual deal: you state &lt;em>what&lt;/em> a solution must satisfy, and a general-purpose solver figures out &lt;em>how&lt;/em> to find one.&lt;span class="margin-note" data-note="freuder&amp;#39;s slogan: the user states the problem, the computer solves it — the closest computer science has come to the holy grail of programming">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

no objective gradient, no simplex tableau — just variables, finite domains, and constraints, attacked by an alternation of &lt;em>inference&lt;/em> (prune values that cannot appear in any solution) and &lt;em>search&lt;/em> (guess, propagate, backtrack). this page builds the machinery from the formalism up; the &lt;a
 href="https://abaj.ai/wiki/ai/csp/sudoku/"
 
 
>sudoku solver&lt;/a> and &lt;a
 href="https://abaj.ai/wiki/ai/csp/hashiwokakero/"
 
 
>hashiwokakero&lt;/a> write-ups on this wiki are the same machinery pointed at actual puzzles.&lt;/p></description></item></channel></rss>