4 ms·
There is also Hatetris[1], with the same premise. Which I discovered because, for Hatetris, he wrote a nice twitter-oriented compact binary-to-text encoding, b
by grandchild 8y ago
There is also Hatetris[1], with the same premise.
Which I discovered because, for Hatetris, he wrote a nice twitter-oriented compact binary-to-text encoding, base65536[2].
[1] https://qntm.org/hatetris https://qntm.org/hatetris
[2] https://github.com/qntm/base65536 https://github.com/qntm/base65536
- sp332 8y agoWhat's the version where, every time you complete a row, it just zooms out so the row isn't complete any more?
- huehehue 8y agoFutilitris!
- ep103 8y agoI was never a fan of this version, it seems to spawn the little S shape almost constantly :(
- lalaithion 8y ago> Yes, you will get a lot of S pieces. But it doesn't give you solely S pieces - if that were the case, then it would be possible to make lines forever, which is much too easy. > If you can't figure out how to turn a constant stream of S pieces to your advantage, that's your problem. Rest assured that once you do, other pieces will appear. If you get creative, it is possible to force all 7 different pieces to appear, including even those incredibly useful T pieces.
- ep103 8y agoI understand both of those points : )
- brianpgordon 8y agoIf anyone is curious, you can see winning one-piece strategies on pages 10-11 (in-document numbering): https://open.library.ubc.ca/media/download/pdf/831/1.0079748/1 https://open.library.ubc.ca/media/download/pdf/831/1.0079748...
- lalaithion 8y agoHe also wrote "Solving Tetris In C" https://qntm.org/tetris https://qntm.org/tetris
- aidenn0 8y agoI've never gotten a better score than 3, nor a T block in hatetris. [edit] Today managed a score of 7 with playing around with it.