Uploaded July 2018 | Updated September 2026, 2 hours ago
The New Tetris (1999) was the first Tetris game that rewarded T-Spins but in an unusual way, namely causing avalanches: the blocks get disconnected and fall all the way to the bottom. In case of T-Spin Doubles it's true for all blocks in the entire field. However, in case of T-Spin Singles, only the blocks below the line clear get disconnected (if you clear the row with the lowest T piece cell).
This causes a strange bug where the top part can become floating. In this video I build a setup where each column had four empty cells below the T-slot. As a result, the top part stops falling in midair, 4 rows above the bottom. Note that in normal Tetris it is not possible to get completely empty rows with some filled cells above.
My second and third T-Spin Singles cause further avalanches - my stack still keeps floating. The third T-Spin even disconnects all blocks in the bottom row of my setup - without any consequences; only the remaining block of my T piece falls to the bottom.
The New Tetris (1999) was the first Tetris game that rewarded T-Spins but in an unusual way, namely causing avalanches: the blocks get disconnected and fall all the way to the bottom. In case of T-Spin Doubles it's true for all blocks in the entire field. However, in case of T-Spin Singles, only the blocks below the line clear get disconnected (if you clear the row with the lowest T piece cell).
This causes a strange bug where the top part can become floating. In this video I build a setup where each column had four empty cells below the T-slot. As a result, the top part stops falling in midair, 4 rows above the bottom. Note that in normal Tetris it is not possible to get completely empty rows with some filled cells above.
My second and third T-Spin Singles cause further avalanches - my stack still keeps floating. The third T-Spin even disconnects all blocks in the bottom row of my setup - without any consequences; only the remaining block of my T piece falls to the bottom.



![Shortest solutions Celebrating 50 years of Kids Coding (Google Doodle Dec 4th 2017)
edit1: way more elegant solution to last riddle (as suggested by David Sili): [ ( move + rotate + move ) x 4 + rotate ] x 4 , rotation direction doesnt matter in both cases
edit2: Apparently, you can change how often a loop is repeated. With it, you can solve last riddle with just 4 elements (as suggested by Andrey Rybak): ( move x 3 + rotate ) x 13, thats the same path as in my solution but way less elements
I am no kid but I thought the doodle looked cool. The solution to the last puzzle looks kinda weird. The goal is to minimize the number of used elements (4 x loop just counts as 1), not the number of steps the bunny makes. Shortest solutions Celebrating 50 years of Kids Coding (Google Doodle Dec 4th 2017)](https://i.ytimg.com/vi/uRFuPfyOL3U/mqdefault.jpg)



