P Versus NP is the most compelling computing problem
yet to be solved. Hence if P can be solved how long
does such take to prove such. It takes more to work
than to prove. NP problems are extremely complicated.
Sudoku and simple Mazes are N level. If you solve one
you can most likely solve the other.