TicTacToe in SQL (Postgres)

Taking it to the next level -<p>Injecting a Chess Engine into Amazon Redshift<p><a href="http:&#x2F;&#x2F;www.michaelburge.us&#x2F;2017&#x2F;09&#x2F;10&#x2F;injecting-shellcode-to-speed-up-amazon-redshift.html" rel="nofollow">http:&#x2F;&#x2F;www.michaelburge.us&#x2F;2017&#x2F;09&#x2F;10&#x2F;injecting-shellcode-to...</a>

Here is a version you can play with online: <a href="https:&#x2F;&#x2F;dbfiddle.uk&#x2F;?rdbms=postgres_11&amp;fiddle=71940aadda50f55bfede87606cd1dc2c" rel="nofollow">https:&#x2F;&#x2F;dbfiddle.uk&#x2F;?rdbms=postgres_11&amp;fiddle=71940aadda50f5...</a>

Yep. Recursive CTE are most bad ass feature of SQL which makes it do stuff that LISP and Haskell does but more declaratively

This Single SQL Query Solved My Sudoku In Seconds<p><a href="http:&#x2F;&#x2F;oraclemine.com&#x2F;sql-query-solved-sudoku-seconds&#x2F;" rel="nofollow">http:&#x2F;&#x2F;oraclemine.com&#x2F;sql-query-solved-sudoku-seconds&#x2F;</a>

Cool, I’m curious, does anyone know - which langauge would use fewest number of characters, to create TicTacToe?