{"version":"1.0","type":"rich","title":"Eight Queens Problem Solved using Common Table Expressions","description":"A SQL query using recursive Common Table Expressions solves the Eight Queens puzzle, enumerating all 92 valid board configurations. The recursive `solutions` CTE incrementally places queens, checking row, column, and diagonal conflicts via arithmetic on board positions. A separate `positions` CTE generates the 64 board cells. A Python script executes the SQL against an in-memory SQLite database, iterating over the result rows and printing each 8×8 board as a text grid with asterisks marking queen placements.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-5e5397b693eb50e67f07?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}