Theorem 6.5, yes case — at least r rows cleared in the padded reservoir game
ProvedTetrisHard.Rows.Padded.paddedReservoir_completenesscomplexity-theorytetris
Let be an admissible rotation model of radius , let be a valid normalized yes-instance of 3-Partition with , and let , , , and even . Then in , at least rows can be cleared:
The enlarged width and staging height provide an all-empty neighborhood for up to three clockwise rotations of every piece; a valid 3-partition fills and clears the upper board, the extra pieces and key clear the buffer shaft, chimney, and second lock, and the squares tile and clear all reservoir rows.
Preamble
import Definitions.Def_TetrisHard_Rows_PaddedGapReduction
Formal statement
namespace TetrisHard.Rows.Padded
theorem paddedReservoir_completeness
(R : Rotation) (hR : R.Admissible)
(P : ThreePartition) (hP : P.Valid) (hN : P.Normalized) (hs : 0 < P.s)
(hyes : P.HasSolution)
(pad K st r : ℕ)
(hpad : max R.radius 2 + 2 ≤ pad)
(hK : 1 ≤ K)
(hst : 5 * max R.radius 2 + 12 ≤ st)
(hr : Even r) :
∃ w, r ≤ w ∧ Attainable R (paddedReservoirGame P pad K st r) w := by sorry
end TetrisHard.Rows.Padded
Source
Demaine, Hohenberger and Liben-Nowell, Tetris is Hard, Even to Approximate, arXiv:cs/0210020v1, Section 3 (p. 7), Section 5.3 (pp. 12-14), Section 6.2 and Figure 9(b) (pp. 19-21), Theorem 6.5 (p. 21), https://arxiv.org/abs/cs/0210020v1