We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

A New Solution for N-Queens Problem using Blind Approaches: DFS and BFS Algorithms

by Farhad Soleimanian Gharehchopogh, Bahareh Seyyedi, Golriz Feyzipour
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 1
Year of Publication: 2012
Authors: Farhad Soleimanian Gharehchopogh, Bahareh Seyyedi, Golriz Feyzipour
10.5120/8389-1998

Farhad Soleimanian Gharehchopogh, Bahareh Seyyedi, Golriz Feyzipour . A New Solution for N-Queens Problem using Blind Approaches: DFS and BFS Algorithms. International Journal of Computer Applications. 53, 1 ( September 2012), 45-48. DOI=10.5120/8389-1998

@article{ 10.5120/8389-1998,
author = { Farhad Soleimanian Gharehchopogh, Bahareh Seyyedi, Golriz Feyzipour },
title = { A New Solution for N-Queens Problem using Blind Approaches: DFS and BFS Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 1 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 45-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number1/8389-1998/ },
doi = { 10.5120/8389-1998 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:53:02.957326+05:30
%A Farhad Soleimanian Gharehchopogh
%A Bahareh Seyyedi
%A Golriz Feyzipour
%T A New Solution for N-Queens Problem using Blind Approaches: DFS and BFS Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 1
%P 45-48
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The N×N queen's puzzle is the problem of placing N chess queen on an N×N chess board so that no two queens attack each other. This approach is a classical problem in the artificial intelligence area. A solution requires that no two queens share the same row, column or diagonal. These problems for computer scientists present practical solution to many useful applications and have become an important issue. In this paper we proposed new resolution for solving n-Queens used combination of depth firs search (DFS) and breathe first search (BFS) techniques. The proposed algorithm act based on placing queens on chess board directly. This is possible by regular pattern on the basis of the work law of minister. The results show that performance and run time in this approach better then back tracking methods and hill climbing modes.

References
  1. M. G. Kaosar, M. Shorfuzzaman, S. Ahmed, "A Novel Approach to Solving N-Queens Problem". In Proceedings of the 8th World Multi conference on Systemic, Cybernetics and Informatics (SCI 2004), Orlando, Florida, USA, pp. 1-5, June 2004.
  2. R. Sosi and J. Gu. "Efficient local search with conflict minimization: A case study of the n-queens problem". IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No. 5, pp. 61-68, 1994.
  3. R. Sosic and J. Gu. "Efficient local search with conflict minimization: A case study of the n-queens problem". IEEE Transactions on Knowledge and DataEngineering, Vol. 6, No. 5, pp. 61-68, 1994.
  4. H. S. Stone and J. M. Stone. "Efficient search techniques - An empirical study of the n-queens problem". IBM Journal of Research and Development, 31: 464-474, 1987.
  5. C. Erbas, S. Sarkeshik, and M. M. Tanik. "Different perspectives of the n-queens problem". In Proceedings ofthe ACM 1992 Computer Science Conference, 1992.
  6. J. Mandziuk. "Solving the n-queens problem with a binary Hopfield-type network synchronous and asynchronous model". Biological Cybernetics, Vol. 72, No. 5, pp. 439-446, 1995.
  7. C. Letavec, J. Ruggiero, The n-Queens Problem, INFORMS Transactions on Education, Vol. 2, No. 3, pp. 101-103.
  8. M. Bozikovic, M. Golub and L. Budin. "Solving n-queens problem using global parallel genetic algorithm". EUROCON, Vol 2, pp 22-24, 2003.
  9. R Sosic and J. Gu. "A polynomial time algorithm for the n-queens problem". SIGART, 1(3): 7-11, 1990.
  10. O. Shagrir. "A neural net with self-inhibiting units for the n-queens problem". International Journal of Neural Systems, Vol. 3, No. 3, pp. 249-252, 1992.
Index Terms

Computer Science
Information Sciences

Keywords

N-queen's Pawn Depth First Search Breathe First Search

Powered by PhDFocusTM