3 ms·
The reason chess is hard to solve is not because it's NP-hard (which it is not, being a constant-sized problem), it's because chess is a big problem. It can si
by jstanley 4y ago
The reason chess is hard to solve is not because it's NP-hard (which it is not, being a constant-sized problem), it's because chess is a big problem.
It can simultaneously be true both that NP-hardness matters, and that constant-sized problems can be hard.
- sweezyjeezy 4y agoI never said chess was NP hard, it was an analogy. The equivalent would be some kind of chess on an NxN or Nx8 board I guess, I don't know how hard would be.