Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:decision |
can a given sequence of pieces clear the board?
|
| gptkbp:describedBy |
Demaine et al. 2003
|
| gptkbp:firstProvedNPCompleteBy |
gptkb:Erik_D._Demaine
|
| gptkbp:firstProvedNPCompleteIn |
2003
|
| gptkbp:hasApplication |
gptkb:artificial_intelligence
algorithmic game theory puzzle design |
| https://www.w3.org/2000/01/rdf-schema#label |
Generalized Tetris
|
| gptkbp:isHardEvenWith |
online version
few rows offline version one column restricted piece sets |
| gptkbp:pieceSequence |
arbitrary
|
| gptkbp:relatedTo |
gptkb:Tetris
|
| gptkbp:rotationModel |
arbitrary
|
| gptkbp:size |
arbitrary
|
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:variant |
gptkb:Tetris
|
| gptkbp:bfsParent |
gptkb:PSPACE
|
| gptkbp:bfsLayer |
5
|