Skip to content

Brute-force search

Definition of Brute-force search:

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

البحث الشامل

تعريف البحث الشامل:

  • تقنية عامة لحل المشكلات تتضمن تحديد جميع الحلول المحتملة وتقييم درجة وفاء كل حل بمتطلبات المشكلة.

if you would like to suggest a word please click SUBMIT BELOW