Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP -hard. It has been evidenced that DNA computing can solve those problems which are currently intractable on even fastest electronic computers. This paper proposes a new DNA algorithm for solving N-Queen problem, a complex optimization problem. The algorithm not only...

This paper presents a new approach to solving N-queen problems, which involves a model of distributed autonomous agents with artificial life (ALife) and a method of representing N-queen constraints in an agent environment. The distributed agents locally interact with their living environment, i.e., a chessboard, and execute their reactive behaviors by applying their behavioral rules for randomi...

The n-queens problem is a classical search problem in the artiicial intelligence (AI) area. In recent years, this problem has found many useful, practical applications including 2-dimensional VLSI routing and testing, maximum full range communication, and parallel optical computing. In this paper we present two new algorithms, called Queen Search 2 (QS2) and Queen Search 3 (QS3). QS2 and QS3 ar...

The queen graph coloring problem consists in covering a n × n chessboard with n queens, so that two queens of the same color cannot attack each other. When the size, n, of the chessboard is a multiple of 2 or 3, it is hard to color the queen graph with only n colors. We have developed an exact algorithm which is able to solve exhaustively this problem for dimensions up to n = 12 and find one so...