▲ | nhumrich 4 hours ago | |
In theory, it's not proof. In practice, it is. | ||
▲ | sigbottle 3 hours ago | parent [-] | |
Well, if the solver isn't wrong and there were no bugs in impl, yes, the approach is rigorous. Allow strictly more "powerful" configurations yet still prove that the maximum is X, then achieve X through a construction, is standard math |