Exhaustive Search
294
浏览
0
关注

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.A brute-force algorithm to find the divisors of a natural number n would enumerate all integers from 1 to the square-root of n, and check whether each of them divides n without remainder. A brute-force approach for the eight queens puzzle would examine all possible arrangements of 8 pieces on the 64-square chessboard, and, for each arrangement, check whether each (queen) piece can attack any other. While a brute-force search is simple to implement, and will always find a solution if it exists, its cost is proportional to the number of candidate solutions - which in many practical problems tends to grow very quickly as the size of the problem increases. Therefore, brute-force search is typically...
[展开]
相关概念
Lower Bound    
Search Space    
State Space    
Indexation    
Block Cipher    
Real Time    
主要的会议/期刊
演化趋势
Chart will load here
Exhaustive Search文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜