20210721, 09:29  #12 
Romulan Interpreter
"name field"
Jun 2011
Thailand
23120_{8} Posts 
Replying to the topic title, if you can prove P=NP, then getting the million bucks is the smallest and least important thing that will happen to you in the next 20 years.
Replying to the most recent discussion, does that mean you have an algorithm that solves generalized sudoku without guessing (i.e. without backtrack)? If so, I would really die to know it, haha. Or sell my soul to the devil, if not sold already, but I believe he won't want it, it would not be a good business for him. Mind that I consider myself a very strong sudoku solver, say top 0.01% world solvers. But I will wait for the official paper to read about that Good luck. Anyhow, as a way to go forward for your team, you could try to transform your algorithm to solve hamiltonian cycle or 3sat, and I believe there are algorithms on the web to transform generalized sudoku into one of these or viceversa. Telling people about sudoku, they are reticent. Tell them about graphs and boolean circuits, you got them by the ears. Funny fact: I used to strongly believe that P=NP too, and many times I got into arguments with my professors because of it. I still believe it, but not so strong anymore. Now it is more like a "hope" . Some of my professors, those who had an opinion (mostly didn't dare to risk it, and preferred to stay at the fact side), believed the contrary, because "otherwise, anybody will be a Mozart". If we would be able to find solutions to problems with about the same speed we can verify that a given solution is right, then writing a symphony, or more thematic, proving a lot of math theory and physics phenomenon, would not take much longer than listening and appreciating the beauty of that same symphony or proof. I was thinking for a while that only our stupidity (i.e. we do not have yet the right algorithms, our current stage of evolution is not high enough, whatever) impede anybody to be a Mozart. I still believe that, by the way, and this has not much to do with P or NP. My way to "prove P=NP" was for a while (read: few years spent in uni and after) related to perfect graphs. These perfect graphs have nice colorability properties, i.e. most coloration problems are polynomial. And every NPcomplete problem can be reduced to a graph problem, and as every graph problem can be reduced to a coloration problem in a graph, and as all graphs with few exceptions are perfect graphs (at the time this was called "Berge conjecture", it was later proved and became the Strong Perfect Graph's Theorem), you see the consequence. It follows that all NPcomplete problems are polynomial with few exceptions, but for the exceptions (nonBerge graphs) the coloring is trivial (i.e. hamiltonian cycle in an odd cycle graph is just the cycle itself, and in its complementary there is a simple linear algorithm to find it). The most of these "inclusions" are already proved, and I still believe that the way to go for showing P=NP is through perfect graphs and coloration. But few things were shaking my belief since that time, one of these few things was reading the SPG proof when it came out. Another was reading (some years ago) about the fact that generalized sudoku is NPcomplete . Because I can't imagine how somebody will solve a well made sudoku grid without backtracking. If you don't believe me, try this grid, without guessing. Courtesy of Mark and Simon, from Cracking the Cryptic youtube channel (google them, it is fun!). This grid is trivial to solve by guessing, but almost impossible to solve by logic, as they proved in two videos. Then think about a 169x169 grid (with 13x13 biscuits) and tell my how would you solve THAT one in O(n^6) You can have few hundreds of chains, every one of them with a hundred links, and you will have to make few hundred guesses, fill each chain, and if the guess was wrong and you got a contradiction, you will need to backtrack and refill with the correct chain. I don't see other way. But again, I may be too stupid to be a Mozart, haha Last fiddled with by LaurV on 20210721 at 10:33 
20210721, 14:18  #13  
"Viliam Furík"
Jul 2018
Martin, Slovakia
2×353 Posts 
Quote:
Quote:
I'll send you more details on inner working of the algorithm in PM (as well as the results of the experiment), but this I will say "publicly": I should be able to get a solution in O(n^12)  unless I found a counterexample to the algorithm. In O(n^6), I should be able to tell you whether it's uniquely solvable, nonuniquely solvable, or nonsolvable. The part about being able to distinguish between unique solutions and nonunique ones is not wellstudied yet. It's only simple observation. EDIT: After running the experiment, I found that at least for the present version of the algorithm, the striken is not true. Last fiddled with by Viliam Furik on 20210721 at 14:32 

20210721, 20:38  #14  
"Tilman Neumann"
Jan 2016
Germany
2^{5}·3·5 Posts 
Quote:
Thanks, my 77year old, sudokuaddicted mother will love it 

20210721, 21:12  #15 
"Viliam Furík"
Jul 2018
Martin, Slovakia
2×353 Posts 
You can google some n=4 grids for her, that's an even bigger challenge. I attached one such grid.

20210721, 22:16  #16 
Apr 2012
Gracie on alert.
195_{16} Posts 
Definitely no poly time script on a classical (binary) system that I'm aware of but there are some good solvers out there.

20210721, 22:59  #17 
"Viliam Furík"
Jul 2018
Martin, Slovakia
2×353 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
What are the most exciting things that can happen in order of likelihood?  EugenioBruno  Information & Answers  21  20200328 21:12 
What will happen?  RichardB  Information & Answers  16  20100903 21:25 
Which will happen first?  Uncwilly  Lounge  11  20050218 14:41 