Y
Hacker News
new
|
ask
|
show
|
jobs
by
alephnan
1520 days 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
1 comments
Closi
1520 days ago
No, there are plenty of zero sum games with perfect information that aren’t np-hard (eg tic tac toe).
link