My greedy cheapest first heuristic also solves hard combinatorial problems super fast. It’s only when you check for goodness of solution that you realize that

My greedy cheapest first heuristic also solves hard combinatorial problems super fast. It’s only when you check for goodness of solution that you realize that their scope is pretty limited. And dangerous, because you have no clue of how bad your solution is.