A parallel algorithm for solving the n-queens problem based on inspired computational model

被引：16

作者：

Wang, Zhaocai ^{[1
]}

Huang, Dongmei ^{[1
]}

Tan, Jian ^{[2
]}

Liu, Taigang ^{[1
]}

Zhao, Kai ^{[3
]}

Li, Lei ^{[4
]}

机构：

[1] Shanghai Ocean Univ, Coll Informat, Shanghai 201306, Peoples R China

[2] Chinese Acad Sci, Ctr Earth Observat & Digital Earth, China Key Lab Digital Earth, Beijing 100094, Peoples R China

[3] Pingdingshan Univ, Acad Affair Off, Pingdingshan 467000, Peoples R China

[4] Xian Univ Architecture & Technol, Dept Civil Engn, Xian 710055, Peoples R China

来源：

BIOSYSTEMS | 2015年 / 131卷

基金：

国家高技术研究发展计划(863计划); 中国国家自然科学基金;

关键词：

DNA computation; The n-queens problem; Adleman-Lipton model; NP-complete problem; MOLECULAR COMPUTATION; DNA SOLUTION; NETWORK;

D O I：

10.1016/j.biosystems.2015.03.004

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

DNA computing provides a promising method to solve the computationally intractable problems. The n-queens problem is a well-known NP-hard problem, which arranges n queens on an n x n board in different rows, columns and diagonals in order to avoid queens attack each other. In this paper, we present a novel parallel DNA algorithm for solving the n-queens problem using DNA molecular operations based on a biologically inspired computational model. For the n-queens problem, we reasonably design flexible length DNA strands representing elements of the allocation matrix, take appropriate biologic manipulations and get the solutions of the n-queens problem in proper length and O(n(2)) time complexity. We extend the application of DNA molecular operations, simultaneity simplify the complexity of the computation and simulate to verify the feasibility of the DNA algorithm. (C) 2015 Elsevier Ireland Ltd. All rights reserved.

引用

页码：22 / 29

页数：8

共 50 条

[41] Results for the n-queens problem on the Mobius board
Bell, Jordan
Stevens, Brett
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 42 : 21 - 34
[42] FAST SEARCH ALGORITHMS FOR THE N-QUEENS PROBLEM
SOSIC, R
GU, J
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (06): : 1572 - 1576
[43] Scalable N-Queens Solving on GPGPUs via Interwarp Collaborations
Pantekis, Filippos
James, Phillip
Kullmann, Oliver
2022 TENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING, CANDAR, 2022, : 158 - 164
[44] Research and Realization of N-Queens Problem Based on the Logic Language Prolog
Gu, Baolei
COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, 2012, 316 : 50 - 56
[45] LINEAR CONGRUENCE EQUATIONS FOR THE SOLUTIONS OF THE N-QUEENS PROBLEM
ERBAS, C
TANIK, MM
ALIYAZICIOGLU, Z
INFORMATION PROCESSING LETTERS, 1992, 41 (06) : 301 - 306
[46] Exhaustive Study of Essential Constraint Satisfaction Problem Techniques based on N-Queens Problem
Ayub, Md Ahsan
Kalpoma, Kazi A.
Proma, Humaira Tasnim
Kabir, Syed Mehrab
Chowdhury, Rakib Ibna Hamid
2017 20TH INTERNATIONAL CONFERENCE OF COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2017,
[47] A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model
Wang, Zhaocai
Ji, Zuwen
Wang, Xiaoming
Wu, Tunhua
Huang, Wei
BIOSYSTEMS, 2017, 162 : 59 - 65
[48] A DYNAMIC-PROGRAMMING SOLUTION TO THE N-QUEENS PROBLEM
RIVIN, I
ZABIH, R
INFORMATION PROCESSING LETTERS, 1992, 41 (05) : 253 - 256
[49] Application of Hopfield Neural Network to the N-Queens Problem
Lapushkin, Andrei A.
BIOLOGICALLY INSPIRED COGNITIVE ARCHITECTURES (BICA) FOR YOUNG SCIENTISTS, 2016, 449 : 115 - 120
[50] Solving N-Queens Problem on GPU Architecture Using OpenCL with special reference to Synchronization Issues
Thouti, Krishnahari
Sathe, S. R.
2012 2ND IEEE INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (PDGC), 2012, : 806 - 810

← 1 2 3 4 5 →