Results 1  10
of
192
The nqueens problem
 American Mathematical Monthly
, 1994
"... which Archimedes devised in epigrams, and which he communicated to students of such matters ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
which Archimedes devised in epigrams, and which he communicated to students of such matters
LETAVEC AND RUGGIERO The nQueens Problem The nQueens Problem
"... The nqueens problem, originally introduced in 1850 by Carl Gauss, may be stated as follows: find a placement of n queens on an n×n chessboard, such that no one queen can be taken by any other. While it has been well known that the solution to the nqueens problem is n, numerous solutions have been ..."
Abstract
 Add to MetaCart
The nqueens problem, originally introduced in 1850 by Carl Gauss, may be stated as follows: find a placement of n queens on an n×n chessboard, such that no one queen can be taken by any other. While it has been well known that the solution to the nqueens problem is n, numerous solutions have been
A Polynomial Time Algorithm for the NQueens Problem
, 1990
"... this paper we present a new, probabilistic local search algorithm which is based on a gradientbased heuristic. This efficient algorithm is capable of finding a solution for extremely large size nqueens problems. We give the execution statistics for this algorithm with n up to 500,000. Keywords: Ar ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
this paper we present a new, probabilistic local search algorithm which is based on a gradientbased heuristic. This efficient algorithm is capable of finding a solution for extremely large size nqueens problems. We give the execution statistics for this algorithm with n up to 500,000. Keywords
A Parallel Search Algorithm for the NQueens Problem
 IEEE Transactions on Systems, Man, and Cybernetics
, 1991
"... The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem. ..."
Abstract
 Add to MetaCart
The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem
A Parallel Search Algorithm for the NQueens Problem
 IEEE Transactions on Systems, Man, and Cybernetics
, 1991
"... The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem. Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem
Quantum Algorithm for NQueens problem
"... We study the application of quantum computing to the Queens problem. The presented quantum algorithm for this combinatorial search problem allows significant reduction of number of iteration. 1 ..."
Abstract
 Add to MetaCart
We study the application of quantum computing to the Queens problem. The presented quantum algorithm for this combinatorial search problem allows significant reduction of number of iteration. 1
Solving NQueen Problem by Prediction
"... Abstract – The classic problems lead the researchers to innovate general solutions for similar class of problems. One of the wellknown problems and its solution are the 8Queen puzzle and back tracking. At many cases back tracking may consider as brute force, but it is not true. It is not necessary ..."
Abstract
 Add to MetaCart
Abstract – The classic problems lead the researchers to innovate general solutions for similar class of problems. One of the wellknown problems and its solution are the 8Queen puzzle and back tracking. At many cases back tracking may consider as brute force, but it is not true
A dynamic programming solution to the nqueens problem
, 1992
"... The nqueens problem is to determine in how many ways n queens may be placed on an nbyn chessboard so that no two queens attack each other under the rules of chess. We describe a simple O ( f(n)8”) solution to this problem that is based on dynamic programming, where f(n) is a loworder polynomial. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The nqueens problem is to determine in how many ways n queens may be placed on an nbyn chessboard so that no two queens attack each other under the rules of chess. We describe a simple O ( f(n)8”) solution to this problem that is based on dynamic programming, where f(n) is a loworder polynomial
THE NQUEENS PROBLEM ON A SYMMETRIC TOEPLITZ MATRIX
"... Abstract. We consider the problem of placing n nonattacking queens on a symmetric n×n Toeplitz matrix. As in the Nqueens Problem on a chessboard, two queens may attack each other if they share a row or a column in the matrix. However, the usual diagonal restriction is replaced by specifying that qu ..."
Abstract
 Add to MetaCart
Abstract. We consider the problem of placing n nonattacking queens on a symmetric n×n Toeplitz matrix. As in the Nqueens Problem on a chessboard, two queens may attack each other if they share a row or a column in the matrix. However, the usual diagonal restriction is replaced by specifying
Parallelization of the Nqueens problem. Load unbalance analysis.
"... The paper presents an analysis of three parallelization structures of the Nqueens problem, taking into account N processors. The focus has been set on investigating the adaptation of the architecture structure to the proposed algorithm type, so as to study the load unbalance in each case, for which ..."
Abstract
 Add to MetaCart
The paper presents an analysis of three parallelization structures of the Nqueens problem, taking into account N processors. The focus has been set on investigating the adaptation of the architecture structure to the proposed algorithm type, so as to study the load unbalance in each case
Results 1  10
of
192