期刊名称：International Journal of Computer Science & Applications
印刷版ISSN：0972-9038
出版年度：2008
卷号：V
期号：II
出版社：Technomathematics Research Foundation
摘要：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 shows whether or not a solution exists, but provides all possible solutions by massively parallel computations. The proposed algorithm can be easily extended to solve other optimization problems.
