this post was submitted on 12 May 2024
231 points (99.1% liked)
Asklemmy
43989 readers
685 users here now
A loosely moderated place to ask open-ended questions
Search asklemmy ๐
If your post meets the following criteria, it's welcome here!
- Open-ended question
- Not offensive: at this point, we do not have the bandwidth to moderate overtly political discussions. Assume best intent and be excellent to each other.
- Not regarding using or support for Lemmy: context, see the list of support communities and tools for finding communities below
- Not ad nauseam inducing: please make sure it is a question that would be new to most members
- An actual topic of discussion
Looking for support?
Looking for a community?
- Lemmyverse: community search
- sub.rehab: maps old subreddits to fediverse options, marks official as such
- [email protected]: a community for finding communities
~Icon~ ~by~ ~@Double_[email protected]~
founded 5 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
You can solve any sudoku easily by trying every possible combination and seeing if they are correct. It'll take a long time, but it's fairly easy.
Well it just so happens that the definition of "easy" in the actual problem is essentially "fast". So under that definition, checking every single possible solution is not an "easy" method.
What if the sudoku is 1 milllion lines by 1 million lines? How about a trillion by a trillion? The answer is still easy to check, but it takes exponentially longer to solve the board as the board gets larger. That's the jist of the problem: Is there a universal solution to a problem like this that can solve any size sudoku before the heat death of the universe?