Theorem 6.5, no case — cumulative cleared rows bounded independently of
OpenTetrisHard.Rows.reservoir_soundnessLet be an admissible reasonable rotation model with staging allowance , let be a valid normalized 3-Partition instance which is a no-instance, and let . In the reservoir game of Figure 9(b) for (staging , reservoir height , piece sequence: original pieces, one RG, squares), every attainable cleared-row count satisfies
where is the height of the original board and the length of the original piece sequence.
Since the original board cannot be cleared, the second lock can never be opened and the reservoir is never entered. Rows cleared before the squares are bounded by the total area above the reservoir divided by the width, and, because the width is odd, the squares can only complete rows that already had an odd number of filled cells when the squares began, so each of the at most rows above the reservoir is cleared at most once by squares.
Formalization Note The paper states the sharper bound 'at most rows', where is the number of rows at or above the second lock. The bound used here is a conservative polynomial cumulative bound, independent of ; it suffices for the theorem.
import Definitions.Def_TetrisHard_Rows_GapReduction
namespace TetrisHard.Rows
theorem reservoir_soundness (R : Rotation) (hR : R.Admissible) (hReason : Reasonable R)
(P : ThreePartition) (hP : P.Valid) (hN : P.Normalized) (hno : ¬ P.HasSolution) (r : ℕ) :
∀ v, Attainable R (reservoirGame P (stagingAllowance R) r) v →
v ≤ noBound P (stagingAllowance R) := by sorry
end TetrisHard.Rows