4 ms·
Not sure if this was sarcasm, but that's like saying NP-hardness is no big deal because we only care about finite problems.
by sweezyjeezy 4y ago
Not sure if this was sarcasm, but that's like saying NP-hardness is no big deal because we only care about finite problems.
- dskloet 4y agoChess on an 8x8 board is not NP-hard. That doesn't mean it's easy but invoking NP-hardness is kind of meaningless.
- bawolff 4y agoLike parent was saying - that is true of all problems in practise since the earth has finite resources. That doesn't make complexity classes a useless concept. In other news, no point in needing pi, because perfect circles dont actually exist in the real world.
- pessimizer 4y agoI don't think people are trying to claim it's unimportant in general, to anyone, they're suggesting that it's completely unimportant in this conversation about how slow and boring championship chess matches are.
- sweezyjeezy 4y agoYes and saying a problem is finite is also kind of meaningless. That narrows it down to everything except infinity. I also did not say that chess is NP-hard, it was an analogy.
- deleted 4y ago[deleted]
- adrianN 4y agoNP-hardness is indeed often not a big deal in practice because NP-hardness is a statement about asymptotic worst case complexity. In practice you have some finite size problems that are often of average difficulty, not of worst case difficulty. For example, we solve instances of SAT every day, some of them quite large. Even humans are able to solve many Sudoku puzzles, even though Sudoku is NP-hard. If you hang with the right crowds (for example people into software correctness), PSPACE completeness is easy and you even solve undecidable problems every day.
- throwaway09223 4y agoI solve the TSP every time I run errands.
- sabageti 4y agoHow Sudoku is NP-Hard?
- CJefferson 4y agoIf you generalise sudoku to a board with sides length, with subsquares with sides length n, then sudoku is no complete.
- jstanley 4y agoThe 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.