I believe they are extending this idea to EDA / chip design tools and algorithms which are also computationally challenging to solve. They have an accepted paper on this for logic synthesis which will come out soon.
[1] "Autonomous Code Evolution Meets NP-Completeness", https://arxiv.org/abs/2509.07367
It would be interesting to take the resulting solver and apply it to an unknown data set.
It is parameter tuning. We have been doing it for centuries.
The big commercial solvers basically are very good at picking up structures and selecting the tuning parameters that work better for specific problem types.
