a parallel algorithm for solving the n-queens problem based on inspired computational model：为解决基于自然计算模型的n皇后问题的并行算法.pdf

BioSystems 131 (2015) 22–29 Contents lists available at ScienceDirect BioSystems j o u rn al h omepage: w w w. elsev /locate/biosystems A parallel algorithm for solving the n-queens problem based on inspired computational model Zhaocai Wang a , Dongmei Huang a,∗ , Jian Tan b,∗∗ , Taigang Liu a , Kai Zhao c , Lei Li d a College of Information, Shanghai Ocean University, Shanghai 201306, PR China b China Key Laboratory of Digital Earth, Center for Earth Observation and Digital Earth, Chinese Academy of Sciences, Beijing 100094, PR China c Academic Affair Office, Pingdingshan University, Pingdingshan 467000, PR China d Department of Civil Engineering, Xi’an University of Architecture Technology, Xi’an 710055, PR China a r t i c l e i n f o a b s t r a c t Article history: DNA computing provides a promising method to solve the computationally intractable problems. The Received 20 December 2013 n-queens problem is a well-known NP-hard problem, which arranges n queens on an n ×n board in Received in revised form 4 March 2015 different rows, columns and diagonals in order to avoid queens attack each other. In this paper, we Accepted 23 March 2015 present a novel parallel DNA algorithm for solving the n-queens problem using DNA molecular operations Available online 27 March 2015 based on a biologically inspired computational model. For the n-queens problem, we reasonably design flexible length