# How Fast Can We Play Tetris Greedily With Rectangular Pieces?

Consider a variant of Tetris played on a board of width w and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only be moved before letting them drop, and a row does not disappear once it is full. Suppose we want to follow a greedy strategy: let each rectangle fall where it will end up the lowest given the current state of the board. To do so, we want a data structure which can always suggest a greedy move. In other words, we want a data structure which maintains a set of O(n) rectangles, supports queries which return where to drop the rectangle, and updates which insert a rectangle dropped at a certain position and return the height of the highest point in the updated set of rectangles. We show via a reduction to the Multiphase problem [Pătraşcu, 2010] that on a board of width w=Θ(n), if the OMv conjecture [Henzinger et al., 2015] is true, then both operations cannot be supported in time O(n^1/2-ϵ) simultaneously. The reduction also implies polynomial bounds from the 3-SUM conjecture and the APSP conjecture. On the other hand, we show that there is a data structure supporting both operations in O(n^1/2log^3/2n) time on boards of width n^O(1), matching the lower bound up to a n^o(1) factor.

• 5 publications
• 24 publications
research
04/18/2018

### Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures

Since the introduction of retroactive data structures at SODA 2004, a ma...
research
05/06/2021

### Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items

In the Two-dimensional Bin Packing (2BP) problem, we are given a set of ...
research
06/12/2018

### The queue-number of posets of bounded width or height

Heath and Pemmaraju conjectured that the queue-number of a poset is boun...
research
10/29/2019

### An Adaptive Step Toward the Multiphase Conjecture

In 2010, Pǎtraşcu proposed the following three-phase dynamic problem, as...
research
06/03/2020

### Dynamic Longest Common Substring in Polylogarithmic Time

The longest common substring problem consists in finding a longest strin...
research
02/12/2020

### Computing Shapley Values for Mean Width in 3-D

The Shapley value is a common tool in game theory to evaluate the import...
research
02/18/2020

### Independent Sets of Dynamic Rectangles: Algorithms and Experiments

We study the maximal independent set (MIS) and maximum independent set (...