Can someone please tell me how you can solve this Sudoku without guessing (i.e. what mathematical principle can you use to solve this w/out guessing any of the remaining boxes).
I know the solution, but it's driving me crazy that I wouldn't have been able to figure it out if I didn't guess.
Please try to keep it relatively simple, I am a brainlet.
Thomas Campbell
There is no mathematical principle, sudoku is an NP problem there is no formula for it, you need to brute force. As the amount of squares increases it's solution time expands exponentially. Unless you think p=np in which case you're a brainlet
Aiden Powell
But with every other puzzle I've done (specifically this is the 'Hard' puzzle, from NYtimes) I have never had to guess before. So, I feel like there must be something I am missing, or some mathematical principle that I could use to solve one square.
There are mathematical rules that apply to Sudoku, for example: If in any row, column, or 3x3 box you have two smaller boxes where only 2 numbers can go, then none of the other boxes in that row, column, or 3x3 box can include those 2 numbers, so you can eliminate them from the other boxes.
I wanted to know if there is some principle like that I am missing.
Mason Foster
t. brainlet who hasn't solved the p=np problem in his spare time
Brandon Taylor
the fact that every sudoku you've found is piss easy doesn't mean that intracable sudokus don't exist. bruteforce it if stuck
Mason Martin
Post proof then fggt
Brandon Jones
So you've never taken linear algebra, then?
Gabriel Stewart
you're an idiot
Luke Reyes
No, you are.
Jaxon Gomez
You can simplify it a bit atleast you have a quad in top left square 1,7,9 x2 and 1,2,9 x2 means that 1,2,7,9 cant be in the column below the three. from there you can conclude that the one must be in the left most column in the second row frist column 3x3 square and there some more stuff you can do from there.
Henry Sanchez
Eliminate the 5s in the lower right square.
Michael Martinez
Good catch. Still doesn't allow me to solve the puzzle without making a guess though.
Anyone else have any clues? Or something else everyone has missed?
Grayson Hall
You're a millennial, aren't you?
Nicholas Fisher
You're just going to have to be more intelligent.
Justin Cruz
The two squares below the 7 top right must be 1 and 8 which means one of the squares below the 2 must be a 5, which means the the 5 in the bottom right must be the one next to the one highlighted. Easy.
Carter Ortiz
Beautiful. Thank you. I already admitted I'm a brainlet, and no I am not a millennial. You, though, are a faggot! PEACE, IM OUT THIS BITCH!
Jack Moore
Are u asking for the mathematical word for lots of guessing? Brute force it
Samuel Perry
You need to learn how to find hidden doubles and triples
Luis Bailey
OP is a brainlet. user saves the day with his genius
Hunter Thomas
Most sudoku grids can be solved without guessing by using but the most difficult ones ever made require some form of guessing. Google "World's hardest sudoku" to find what I'm talking about
Alexander Stewart
>no guessing What do you mean by this?
There are 81 squares and each of them can take 9 possible values, so there are at most 81^9 possible Sudoku grids. You can easily write a program (or, less easily, do it by hand) that generates and checks all possible grids iteratively, stopping and returning the first found grid such that: - for every row and every number 1-9, that number appears exactly once among the 9 squares in that row - for every column and every number 1-9, that number appears exactly once among the 9 squares in that column - for every box and every number 1-9, that number appears exactly once among the 9 squares in that box - for every square that is filled in the initial starting grid, the values agree No guessing involved, guaranteed to find a solution if it exists, and if you want to find all solutions just keep going until you search all 81^9 grids.
Parker Butler
This can be solved by Grobner basis. In a similar manner to a k-coloring problem. In this case it is a equivalent to a 9-color problem.