The N-Queens problem is a well-known NP-Hard
problem originally proposed by the chess player Max Bezzel
and introduced in 1850 by Carl Gauss. The n-Queen problem
is basically a generalized form of 8-Queen problem. In 8-
Queen problem, the goal is to place 8 queens such that no
queen can kill the other using standard chess queen moves.
So, in this paper, the proposed solution will be applied to 8-
Queen problem by making use of Artificial Intelligence (AI).
The solution can very easily be extended to the generalized
form of the problem for large values of `n'. Empirical
observations of smaller-size problems show that the number
of solutions increases exponentially with increasing n. Search
based algorithms have been developed to generate all possible
solution sets for a given nXn board. In practice, however,
these approaches provide a very limited class of solutions for
large size boards.
Published In:IJCSN Journal Volume 5, Issue 5
Date of Publication : October 2016
Pages : 797-800
Figures :05
Tables :--
Shimon Johnson : Department of Computer Science, Mumbai University,
Mumbai, Maharashtra, 400703, India.
Srujan Shetty : Department of Computer Science, Mumbai University,
Mumbai, Maharashtra, 400703, India.
Aaron Philip : Department of Computer Science, Mumbai University,
Mumbai, Maharashtra, 400703, India.
Nitin Varghese : Department of Computer Science, Mumbai University,
Mumbai, Maharashtra, 400703, India.
Amroz Kamal : Associate Professor, Mumbai University, Department of Computer Science,
Fr. Conceicao Rodrigues Institute of Technology,
Mumbai, Maharashtra, 400703, India.
It is expected that in the near future every industrial sector
will be fully automated which requires the system to have the ability to think itself. We expect this might be a big
step towards achieving that goal as our system is able to
place the queens in non-conflicting positions.
[1] Wheland, Norman D. (October 1978). "A Computer
Chess Tutorial". BYTE. p. 168. Retrieved 17 October
2013.
[2] “Linear Congruence Equations for The Solutions of
The N-Queens Problem” (By Erbas, M.M. Tanik, Z.
Aliyazicioglu)
[3] “A Circulant Matrix Based Approach to Storage
Schemes for Parallel Memory Systems” (By C. Erbas,
M.M. Tanik, V.S.S. Nair)
[4] “A Graph Model for Deadlock Prevention, Ph.D.
Thesis, Texas A & M University, 1978” (By M.M.
Tanik)
[5] "A Survey of Known Results and Research Areas for
N-Queens" (By Bell, Jordan; Stevens, Brett).