3 ms·
Could prove tricky. After all, Tetris is NP-complete: http://arxiv.org/abs/cs.CC/0210020 http://arxiv.org/abs/cs.CC/0210020 (kind of an interesting proof -- th
by dangrover 18y ago
Could prove tricky. After all, Tetris is NP-complete: http://arxiv.org/abs/cs.CC/0210020 http://arxiv.org/abs/cs.CC/0210020
(kind of an interesting proof -- they reduce it to the problem of partitioning multisets of numbers into groups of equal sums)