It's difficult to test this without a tool, so instead, perhaps one of you guys would know... in a Tetris game that follows TTC guidelines, can you clear one of the two hidden rows? I assume you can, as improbable as that may be.
One way to test this is to hold an I, then build like this: Code: 21|TTT JJJ| <- hidden 20| T G J| 19|GGGGG GGGG| 18| GG GG | 17| GG GG | The "bookends" at the top can be J, L, or T. fnord: Is this how you tested it?
That would've been the smartest way to do it, but that's not how I did it. I cleared it with a T. (and didn't use 'bookends' on both sides either)
