Re:Tetris Is Hard, Even to Approximate
by bjourne on Saturday March 30, 2019 @01:57PM
(#19530770)
That is the "even to approximate" part. It means that Tetris is NP-hard AND no polynomial time algorithm can be shown to be within a constant factor of the optimal solution. Eg no matter how good your Tetris bot is, there may be one that is a thousand times better waiting to be discovered.
[ Parent
| on HN ]
There are no comments on this comment yet.