Tetris is Hard, Made Easy

From Meritology

Jump to: navigation, search

Author's Abstract

In their paper "Tetris is Hard, Even to Approximate", Demaine, Hohenberger and Liben-Nowell show that optimally playing the "offline" version of Tetris, where the initial board and piece sequence are known, is NP-hard. This is done by reducing the so-called 3-Partition problem to this "offline" Tetris problem. In this document a much simpler way to accomplish the same is suggested.


Resource: [1] Title: Tetris is Hard, Made Easy Author: Ron Breukelaar, Hendrik Jan Hoogeboom, and Walter A. Kosters

Retrieved from "http://www.meritology.com/wiki/Tetris_is_Hard%2C_Made_Easy"