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 条
  • [21] A Quantum-Inspired Differential Evolution Algorithm for Solving the N-Queens Problem
    Draa, Amer
    Meshoul, Souham
    Talbi, Hichem
    Batouche, Mohamed
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2010, 7 (01) : 21 - 27
  • [22] Solving the n-Queens Problem Using a Tuned Hybrid Imperialist Competitive Algorithm
    Masehian, Ellips
    Akbaripour, Hossein
    Mohabbati-Kalejahi, Nasrin
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2014, 11 (06) : 550 - 559
  • [23] A parallel algorithm for solving the n-queens problem based on inspired computational model
    Wang, Zhaocai
    Huang, Dongmei
    Tan, Jian
    Liu, Taigang
    Zhao, Kai
    Li, Lei
    BIOSYSTEMS, 2015, 131 : 22 - 29
  • [24] Regular solutions of the n-queens problem on the torus
    Burger, AP
    Mynhardt, CM
    Cockayne, EJ
    UTILITAS MATHEMATICA, 2004, 65 : 219 - 230
  • [25] A polynomial time algorithm for the n-queens problem
    El-Qawasmeh, E
    Al-Noubani, K
    Proceedings of the Second IASTED International Conference on Neural Networks and Computational Intelligence, 2004, : 191 - 195
  • [26] Neural networks for the N-Queens Problem: a review
    Mandziuk, J
    CONTROL AND CYBERNETICS, 2002, 31 (02): : 217 - 248
  • [27] The N-queens Problem on a symmetric Toeplitz matrix
    Szaniszlo, Zsuzsanna
    Tomova, Maggy
    Wyels, Cindy
    DISCRETE MATHEMATICS, 2009, 309 (04) : 969 - 974
  • [28] THE MODULAR N-QUEENS PROBLEM IN HIGHER DIMENSIONS
    NUDELMAN, SP
    DISCRETE MATHEMATICS, 1995, 146 (1-3) : 159 - 167
  • [29] Optimized massively parallel solving of N-Queens on GPGPUs
    Pantekis, Filippos
    James, Phillip
    Kullmann, Oliver
    O'Reilly, Liam
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2024, 36 (10):
  • [30] Reducing the time complexity of the n-queens problem
    El-Qawasmeh, E
    Al-Noubani, K
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2005, 14 (03) : 545 - 557
12345