General algorithm that incrementally builds candidates to the solutions (tree) and abandons each practical candidate as soon as it is found that this partial solution is not a choice.
E.g. in 8-queen problem, putting second queen in front or diagonal is not a correct solution and this discard it.
Backtrack solution can be better to Brute - Force as it discard many combinations (candidate solutions).