Problemadvanced
Tetris problem
Also called Tetris complexity, Optimal Tetris placement.
Decide whether a given piece sequence can be survived or cleared; NP-complete for optimal play with known sequence.
Decide whether a given piece sequence can be survived or cleared; NP-complete for optimal play with known sequence.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag QESA6R Edit this page History Report an error