<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Constraint Search on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/constraint-search/</link><description>Recent content in Constraint Search on Jeanphilo Blog</description><generator>Hugo -- 0.161.1</generator><language>en-us</language><lastBuildDate>Sun, 19 Apr 2026 14:49:56 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/constraint-search/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100: N-Queens Incremental Build Tutorial</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/backtracking/51-n-queens/</link><pubDate>Sun, 19 Apr 2026 14:49:56 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/backtracking/51-n-queens/</guid><description>A teaching-first incremental tutorial for LeetCode 51 that grows the N-Queens solution from a tiny example and a minimal DFS into column and diagonal state optimization.</description></item></channel></rss>