I tried to solve 9x9 Sudoku using "Topological Entanglement" instead of Backtracking

The "Eureka" Moment: Cycles as Linear Evolution While building a Static Topological Task Orchestration Engine ( @meshflow/core ), I hit a philosophical wall: In traditional Computer Science, circular dependencies are "errors." In reality, they are just feedback loops. Inspired by the movie Tenet , I realized: A loop in space is just a linear line in time. If we view a "cycle" within a single execution tick, it’s not a deadlock—it’s an evolutionary convergence. I wanted to see if I could solve a 9x9 Sudoku not by "guessing and checking," but by letting the logic collapse into a solution. 🧪 The Experiment: Causal Resonance I skipped the traditional Recursive Backtracking (the brute-force way) and built a Sudoku solver where every cell is a node in a causal graph. Size : The core engine is a tiny 10KB (minified). Zero Snapshots : It doesn't save states to go back. No "undo." Pure Pressure : When you enter a number, "causal ripples" propagate through the graph. Contradictions downstream ac