A novel approach to solving N-queens problem

被引：0

作者：

Kaosar, G ^{[1
]}

Shorfuzzaman, M ^{[1
]}

Ahmed, S ^{[1
]}

机构：

[1] King Fahd Univ Petr & Minerals, Dept Comp Engn, Dhahran 31261, Saudi Arabia

来源：

8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING | 2004年

关键词：

artificial intelligence; backtracking; horse movement; divide-and-conquer; permutation;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Placing n mutually non-attacking queens on an n by n chessboard is a classical problem in the artificial intelligence (AI) area. Over the past few decades, this problem has become important to computer scientists for providing solutions to many useful and practical applications. In this paper, we present a novel approach to solving the n-queens problem in a considerably less execution time. The proposed technique works by directly placing the queens on the board in a regular pattern based on some queen-movement rules.

引用

页码：186 / 190

页数：5

共 50 条

[1] A modified Hopfield model for solving the N-Queens problem
da Silva, IN
de Souza, AN
Bordon, ME
IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL VI, 2000, : 509 - 514
[2] THE N-QUEENS PROBLEM
RIVIN, I
VARDI, I
ZIMMERMANN, P
AMERICAN MATHEMATICAL MONTHLY, 1994, 101 (07): : 629 - 639
[3] Modified Genetic Algorithm for Solving n-Queens Problem
Heris, Jalal Eddin Aghazadeh
Oskoei, Mohammadreza Asgari
2014 IRANIAN CONFERENCE ON INTELLIGENT SYSTEMS (ICIS), 2014,
[4] Development of neurofuzzy architecture for solving the N-Queens problem
Da Silva, IN
Ulson, JA
De Souza, AN
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2005, 34 (06) : 717 - 734
[5] N-QUEENS PROBLEM
BRUEN, A
DIXON, R
DISCRETE MATHEMATICS, 1975, 12 (04) : 393 - 395
[6] Landscape analysis and efficient metaheuristics for solving the n-queens problem
Masehian, Ellips
Akbaripour, Hossein
Mohabbati-Kalejahi, Nasrin
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (03) : 735 - 764
[7] Landscape analysis and efficient metaheuristics for solving the n-queens problem
Ellips Masehian
Hossein Akbaripour
Nasrin Mohabbati-Kalejahi
Computational Optimization and Applications, 2013, 56 : 735 - 764
[8] An Efficient Parallel Hardware Scheme for Solving the N-Queens Problem
Azuma, Yuuma
Sakagami, Hayato
Kise, Kenji
2018 IEEE 12TH INTERNATIONAL SYMPOSIUM ON EMBEDDED MULTICORE/MANY-CORE SYSTEMS-ON-CHIP (MCSOC 2018), 2018, : 16 - 22
[9] The n-queens completion problem
Stefan Glock
David Munhá Correia
Benny Sudakov
Research in the Mathematical Sciences, 2022, 9
[10] A novel assembly evolutionary algorithm for n-queens problem
Zeng, Congwen
Gu, Tianlong
CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS, 2007, : 171 - 174

← 1 2 3 4 5 →