CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Unique Solution for N queen Problem

by Vishal Kesri, Vaibhav Kesri, Prasant Ku. Pattnaik
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 43 - Number 12
Year of Publication: 2012
Authors: Vishal Kesri, Vaibhav Kesri, Prasant Ku. Pattnaik
10.5120/6152-8539

Vishal Kesri, Vaibhav Kesri, Prasant Ku. Pattnaik . An Unique Solution for N queen Problem. International Journal of Computer Applications. 43, 12 ( April 2012), 1-6. DOI=10.5120/6152-8539

@article{ 10.5120/6152-8539,
author = { Vishal Kesri, Vaibhav Kesri, Prasant Ku. Pattnaik },
title = { An Unique Solution for N queen Problem },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 43 },
number = { 12 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume43/number12/6152-8539/ },
doi = { 10.5120/6152-8539 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:33:10.878971+05:30
%A Vishal Kesri
%A Vaibhav Kesri
%A Prasant Ku. Pattnaik
%T An Unique Solution for N queen Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 43
%N 12
%P 1-6
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The N-queens problem is a popular classic puzzle where numbers of queen were to be placed on an n x n matrix such that no queen can attack any other queen. The Branching Factor grows in a roughly linear way, which is an important consideration for the researchers. However, many researchers have cited the issues with help of artificial intelligence search patterns say DFS, BFS and backtracking algorithms. We have conducted an extensive study on this problem and realized that no algorithms so far designed with simple formula based. This paper includes a new paradigm which able to compute one unique solutions to the N-queens problem. Again our experimental study brings out a significant outcome.

References
  1. Gutiérrez-Naranjo, Miguel A., Martínez-del-Amor Miguel A. , Pérez-Hurtado Ignacio, and Pérez-Jiménez Mario J. February 02, 2009. “Solving the N-Queens Puzzle with P Systems”, 7th Brainstorming Week on Membrane Computing, volume 1, pp199-210.
  2. Letavec, C. and Ruggiero, J. 2002. "The n-queen problem", Informs Transaction on Education, volume 2 number 3, may 2002.
  3. Uninformed Search Analysis of the N-queens Problem, Ben Sauerwine, September 20, 2003. http://www. andrew. cmu. edu/user/bsauerwi/research/P1. pdf
  4. Russell, S. and Norvig, P. "Artificial Intelligence A Modern Approach", Second Edition, pp 139-140.
  5. Martinjak, I. and Golub, M. 2007. Comparison of Heuristic Algorithms for the N-Queen Problem, "Proceedings of the ITI 2007 29th Int. Conf. on Information Technology Interfaces June 25-28", Cavtat, Croatia.
  6. Hynek, J. Genetic Algorithms for the N-Queens Problem. http://nguyendangbinh. org/Proceedings/IPCV08/Papers/GEM4444. pdf
  7. Ahrabian, H. , Mirzaei, A. and Nowzari-dalini, A. A dna sticker algorithm for solving N-Queen problem, "International Journal of Computer Science and Applications", Vol. 5, No. 2, pp 12 – 22.
  8. Horowitz, E. , Sahni, S, and Rajasekaran, S. "Fundamental of Computer Algorithm (pp-339-355)"
  9. Nilsson, N. J. Artificial Intelligence A New Synthesis, pp 188-189.
Index Terms

Computer Science
Information Sciences

Keywords

First Half Second Half-a Second Half-b Change Queen

Powered by PhDFocusTM