ASP-completeness for other piece subsets beyond {I,T,L} and {I,T,J}

Ascertain whether Tetris clearing under the Super Rotation System (SRS) is ASP-complete for piece subsets that are not supersets of {I, T, L} or {I, T, J}, and in particular determine the ASP-completeness status for all 1-piece and 2-piece subsets.

Background

The paper establishes ASP-completeness for Tetris clearing under SRS with the three-piece sets {I, T, L} and {I, T, J}, via parsimonious reductions from Numerical 3-Dimensional Matching with Distinct Integers.

The authors note that while similar techniques may extend to other 3-piece sets, handling 1- or 2-piece subsets likely requires new ideas because the existing ASP constructions depend on specific priming behaviors not available with fewer piece types.