> Will we ever know if NP can be reduced to P??? My opinion is that it cannot, due to the unbounded nature of NP problems[0]. Regarding sudoku specifically, t

> Will we ever know if NP can be reduced to P??? My opinion is that it cannot, due to the unbounded nature of NP problems[0]. Regarding sudoku specifically, the question is a bit more nuanced (as described here[1]). As for the NP nature of sudoko in its general form, a short but very informative description can be found here[2]. HTH 0 - https://en.wikipedia.org/wiki/NP_(complexity) https://en.wikipedia.org/wiki/NP_(complexity) 1 - https://stackoverflow.com/questions/50703174/is-sudoku-np-complete/50703232#50703232 https://stackoverflow.com/questions/50703174/is-sudoku-np-co... 2 - http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/sudoku.html http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/sudoku.html