That’s the problem exactly. Are there really wormholes? If they don’t exist in physics, then should they exist in math?
Here’s a recent proof of P !=NP based on the Intrinsic Operational Gradient Theorem

The idea here is to first fill the unsolved cells with an easy possibilities state with coloring that is allowed to repeat once for every sub grid row or column. Then slide with cell to cell relations in each sub grid row or column of a cell from the state of repeated singles to pairs where the number in a pair can repeat only once and some triples where if the number is in a triple it can repeat twice.
And start to put in true single clues until from one legal move at a time per cell you slide to a fully non repeating colour value for every unsolved cell in the grid.

Note.
You can test assumed true values collectively on an open grid version of the problem to find definite conflicts and more local optimal truth value relations.
You can also test for wrong numbers against the open grid. Or use the most faulty and true numbers to assort colours into labeled colour group grid problems to find definite conflicts with single colours or groups of colour possibilities of a cell.
You can also slide in values you learned are true after the initial clues to allow flexibility and snap to.
You can have groupings of numbers entangled for sub grids rows or columns to increase the potential incremental hardening.

The question is with all this technique how well can you flatten the Matt how close can you get to the real values for the cells if not perfectly then how good an approximation in a quick enough time. Could you improve on the current big O or accuracy.

. . . I forgot that ; If there is a proof that P=NP ! , so , will this proof also indirectly prove that Wormholes exist since they look similar ?
I am drooling again . . . . Thank you

I don’t have your math background so I probably made a few mistakes you could spot if you had a second to look it over 🙂

So you have groups of lines and you have to connect the line one line connected to another line but only one connection per line and your not allowed to connect a group more than once to another group. This problem might be np complete.

Those are my thoughts regarding the issue.

Thanks.