of hard problems of 400 variables.
It is worrisome that the next case of 500 variables is definitely not able to reduce
the entropy to 0. Somehow the problem is that it gets to solve a big part of a sub problem
very fast but this may not be the same path towards the global solution.
So I guess the simple of criteria of finding a low entropy may push the algorithm towards
great sub-solutions but not the global one. I guess I will have to find a way to consider
the viability of the chosen path by asking not solely how it is reducing the entropy but how
blocked it is becoming (meaning checking the entropy variance in every variable at its extremes).
Let's see what can we do.
Let's recognize, there must be a way otherwise we would not be reducing
constantly the time every year.
I have the intuition that it contains sub hard small problems inside a big one, like combine certain sub graphs in the exact combination.
This is the impression from the observation of how the entropy changed in the different stages during big hard problems search.
I'll keep posting.
