140 bytes appears to be the size of the function that does one state update step, but it excludes the code for showing the board, for interactions, for time based updates, or am I not understanding the code correctly?
To me it seems a cool bit of code, but I don't understand in what way it can be considered "tetris in 140 bytes"
I believe the concept is to compress the logic into 140 bytes or less, not the whole application, the initialisation code is for "free".
My favourite part of these experiments is watching the gist comments, it's fascinating to see just how many bytes can be crushed from already tiny code, with a bit of help.
11 comments
[ 2.3 ms ] story [ 30.9 ms ] threadTo me it seems a cool bit of code, but I don't understand in what way it can be considered "tetris in 140 bytes"
My favourite part of these experiments is watching the gist comments, it's fascinating to see just how many bytes can be crushed from already tiny code, with a bit of help.