Intermediate · Fundamentals
Brute-force search
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. A general problem-solving technique that checks every possible solution systematically until the correct one is found, often computationally expensive.
Technical Definition
A general problem-solving technique that checks every possible solution systematically until the correct one is found, often computationally expensive.
How it works
Brute-force search, also known as exhaustive search, is a straightforward algorithmic approach. It explores all potential solutions to a problem by systematically enumerating and checking every possibility. While simple to implement, it becomes highly inefficient for large problem spaces due to its extensive computational requirements.
Related Concepts
- Search algorithm — A process for finding information or solutions within data or a problem space.