Restructure blogs as Astro monorepo

sites/art/src/content/puzzles/knights-tour-interactive.md

@@ -0,0 +1,35 @@
+---
+title: "The Knight's Tour: An Interactive Exploration"
+description: "An interactive puzzle exploring the knight's tour problem with surprising mathematical connections."
+pubDate: "Jan 30 2024"
+image: "https://images.unsplash.com/photo-1528819622765-d6bcf132f793?w=400&auto=format&fit=crop&q=60"
+authorImage: "/avatar/avatar1.png"
+authorName: "Neeldhara"
+---
+
+# The Knight's Tour: An Interactive Exploration
+
+Can a knight visit every square on a chessboard exactly once? This ancient puzzle hides deep mathematical structure.
+
+## The Basic Challenge
+
+Start with a 5×5 board. Can you find a knight's tour? What about one that returns to the starting square (a closed tour)?
+
+## Mathematical Beauty
+
+The problem connects to:
+- Hamiltonian paths in graphs
+- Warnsdorff's heuristic
+- Magic squares (surprisingly!)
+
+## The Algorithm
+
+The key insight: always move to the square with fewest onward moves. This simple heuristic works remarkably well.
+
+## Try It Yourself
+
+[Interactive board would go here - imagine clicking squares to build your tour]
+
+## Going Deeper
+
+For which board sizes do closed tours exist? The answer involves beautiful number theory.