Squaring the Circle: Running Depth-First Chess Search on a Set-Based Language

I wrote this technical deep-dive to explore the paradigm mismatch between declarative, set-based processing and sequential, depth-first search algorithms. The write-up walks through the mechanics of forcing a relational database engine (DuckDB) to handle chess logic, specifically: Data Representation: Mapping 64-bit bitboards into a relational model using UBIGINT types. The Pruning Blocker: Why the stateless nature of relational sets prevents sibling nodes from communicating, making true Alpha-Beta pruning