News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by ineedasername on Tuesday July 20, 2021 @07:06PM (#27900400)
Ah, true... Given the double criteria for that (lack of pawn movement) it extends things a bit, but there would still be a finite number of moves.

However on an info it's chess board there would always be a unique board state possible. That doesn't by any means refute your point, only add a twist to things.

There are no comments on this comment yet.