Tetris is NP-hard even with $O(1)$ rows or columns.
Sualeh AsifMichael J. CoulombeErik D. DemaineMartin L. DemaineAdam HesterbergJayson LynchMihir SinghalPublished in: CoRR (2020)
Keyphrases
- np hard
- rows and columns
- optimal solution
- approximation algorithms
- np complete
- lower bound
- special case
- branch and bound algorithm
- linear programming
- scheduling problem
- minimum cost
- small number
- integer programming
- computational complexity
- np hardness
- computationally hard
- closely related
- worst case
- greedy heuristic
- neural network
- remains np hard
- multi agent
- feature selection
- genetic algorithm
- knapsack problem
- decision problems
- constraint satisfaction problems
- evolutionary algorithm
- computer vision
- artificial intelligence