  We prove NP-hardness and #P-hardness of Tetris clearing (clearing an initial
board using a given sequence of pieces) with the Super Rotation System (SRS),
even when the pieces are limited to any two of the seven Tetris piece types.
This result is the first advance on a question posed twenty years ago: which
piece sets are easy vs. hard? All previous Tetris NP-hardness proofs used five
of the seven piece types. We also prove ASP-completeness of Tetris clearing,
using three piece types, as well as versions of 3-Partition and Numerical
3-Dimensional Matching where all input integers are distinct. Finally, we prove
NP-hardness of Tetris survival and clearing under the "hard drops only" and
"20G" modes, using two piece types, improving on a previous "hard drops only"
result that used five piece types.
