. Chinook, with its deep search and endgame databases, has established itself as a Grandmaster checker player. However, the match demonstrated that current brute-force game-playing techniques alone will be insufficient to defeat human champions in games as complex as checkers. This paper re-examines brute-force

We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various settings of the parameters n, d, p, and q, our results indicate that symmetric polynomials yield the maximum correlation

Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the information of the type and the property that should be satisfied, this algorithm is able to find automatically

The Data Encryption Standard (DES) has been the workhorse of cryptography for some 20 years. Its wide deployment and now-small key size make it an interesting target for attackers. This paper discusses the first public "crack" of a DES-encrypted message using brute force, and shows

Abstract—Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word via the uniform distribution maximizes the attacker’s difficulty, its Guesswork, in identifying the chosen word. It is tempting to use this property in cryptanalysis of computationally secure ciphers by assuming coded words are drawn from a source’s typical set and so, for all intents and purposes, uniformly distributed within it. By applying recent results on Guesswork, for i.i.d. sources it is this equipartition ansatz that we investigate here. In particular, we demonstrate that the expected Guesswork for a source conditioned to create words in the typical set grows, with word length, at a lower exponential rate than that of the uniform approximation, suggesting use of the approximation is ill-advised. I.

Concerns about computational problems requiring brute-force or exhaustive search methods have gained particular attention in recent years because of the widespread research on the “P = NP? ” question. The Russian word for “bruteforce search ” is “perebor. ” It has been an active research area

We present a biologically-inspired face detection system. The system applies notions such as saliency, gist, and gaze to localize a face without performing blind spatial search. The saliency model consists of highly parallel low-level computations that operate in domains such as intensity

Abstract not found

Adding selectivity to brute-force searching. Artificial Intelligence, 43(1):99–

, for inputs of size n, a naïve brute-force search of the k-exchange neighborhood requires nO(k) time, which is not practical even for very small values of k. We show that for several classes of sparse graphs, like planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor