32 ms·
> Mathematically, we can formulate this a sequential zero-sum game with perfect information. Is this not just restating that Tetris is NP-hard? https://arxiv.o
by alephnan 5y ago
> Mathematically, we can formulate this a sequential zero-sum game with perfect information.
Is this not just restating that Tetris is NP-hard? https://arxiv.org/abs/2009.14336 https://arxiv.org/abs/2009.14336
- Closi 5y agoNo, there are plenty of zero sum games with perfect information that aren’t np-hard (eg tic tac toe).