But a NP-hard problem is not necessarily hard to solve in a specific case. So most solvers try basically to enumerate possible solutions and prune them before s

But a NP-hard problem is not necessarily hard to solve in a specific case. So most solvers try basically to enumerate possible solutions and prune them before solving them. I would expect a smarter approach in solvers' design.