Brute-force search

Brute-force search

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Invention
Domain
Science and technology
Knowledge cost
2
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

Excerpt from the Wikipedia article “Brute-force search”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Brute-force search to your collection.

Play for free

Related cards