nffaria

5 ms·

1. 1.▲
   by nffaria 2y ago

   Noita is an amazingly complex game, from the alchemy reactions, to the cryptographic secrets [1], to the wand building mechanic -- which is itself like a small programming language. Here is someone using a (really complex) wand to beat the
2. 2.▲
   by nffaria 2y ago

   Mainly to see if it was possible. I have been wondering for quite some time how far can you push SQL, given it is Turing complete.
3. 3.▲
   by nffaria 2y ago

   While there were some workarounds needed to implement the game, such as handling input and output, the core of the game logic uses regular SQL. Even recursive CTEs are part of the SQL standard ( https://en.wikipedia.org/wiki&
4. 4.▲
   by nffaria 2y ago

   Thanks for the kind words, it was exactly like you described. Many times I thought it would not be possible after hitting some of those walls, but luckily there was always a way around them.
5. 5.▲
   Show HN: Using SQL's Turing completeness to build Tetris(github.com)

   338 points by nffaria 2y ago|19 comments