A problem-solving technique and algorithmic paradigm that systematically enumerates all possible candidates for a solution and checks each one for validity.
To find the shortest path between two cities on a map, a brute-force search could be used by generating all possible routes and checking each one for distance and accuracy.