Theorem 6.5, yes case — at least rows cleared in the reservoir game
OpenTetrisHard.Rows.reservoir_completenessLet be an admissible reasonable rotation model and let be the fixed staging allowance, where is the radius of . Let be a valid normalized 3-Partition instance with parts which is a yes-instance, and let be even.
Consider the game of Figure 9(b): the original gameboard (with staging ) widened by four completely filled columns, above a two-row second lock opened only by an RG, above an -row reservoir empty except in the first column. The piece sequence is the original sequence, then one RG, then squares. Then
Indeed, the original board can be cleared completely, the RG opens the second lock, and the squares tile and clear all reservoir rows. This is the yes case in the proofs of Theorems 6.3–6.5.
Formalization Note The hypothesis excludes the degenerate empty instance, for which the base board has width and the I pieces cannot spawn (see the mission discussion on Theorem 4.1). Attainable scores count rows cleared by finite legal prefixes of play.
import Definitions.Def_TetrisHard_Rows_GapReduction
namespace TetrisHard.Rows
theorem reservoir_completeness (R : Rotation) (hR : R.Admissible) (hReason : Reasonable R)
(P : ThreePartition) (hP : P.Valid) (hN : P.Normalized) (hs : 0 < P.s)
(hyes : P.HasSolution) (r : ℕ) (hr : Even r) :
∃ v, r ≤ v ∧ Attainable R (reservoirGame P (stagingAllowance R) r) v := by sorry
end TetrisHard.Rows