Brute Force: Solving Puzzles
The idea is that given enough time, a solution can be found without using any logic at all.
The modern computer, with it's ability to do millions of computations per milisecond, condenses time to provide a speedier solution. Perhaps one of the most famous anecdotes of brute force is the Infinite monkey theorem.
Infinite Monkey Theorem (excerpt)
The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type a particular chosen text, such as the complete works of William Shakespeare. In this context, "almost surely" is a mathematical term with a precise meaning, and the "monkey" is not an actual monkey; rather, it is a metaphor for an abstract device that produces a random sequence of letters ad infinitum. The theorem illustrates the perils of reasoning about infinity by imagining a vast but finite number, and vice versa. The probability of a monkey typing a given string of text as long as, say, Hamlet, is so tiny that, were the experiment conducted, the chance of it actually occurring during a span of time of the order of the age of the universe is minuscule but not zero.