Solution to n-Queens Problem: Heuristic Approach

Authors

  • Edgar Osaghae Federal University Lokoja, Nigeria

DOI:

https://doi.org/10.14738/tmlai.92.9849

Abstract

Finding non-backtracking solutions to n-queens problems, has been very challenging. Several researchers have attempting to find non-backtracking solutions to n-queens problem, although, some of them recorded huge successes in their researches, but none of them have attempting using the implications of even and odd n-queens, to find solutions to the n-queens problem. In this paper, an attempt was made to extract patterns created from even-numbered n-queens and odd-numbered n-queens placements on the chessboard. The research started from experimenting the placements of  non-attacking queens for 4-queens, 16-queens, 32-queens and n-queens. After the experimenting with the placements of different number of queens on the chessboard, it was revealed that even-numbered and odd-numbered queens, have pattern of placement of queens. The results of this research work show how to start and finish placements of queens on the chessboard, depending on whether the n number of queens are either even or odd, using heuristic approach.     

References

K. Vishal and C. Sarvesh, “Review on n-Queen Optimization using Tuned Hybrid ”, International Journal of Engineering Sciences and Research Technology, vol. 6, no. 2, pp. 62-68, 2017.

S. Rok and G. Jun, “A Polynomial Time Algorithm for the N-Queens Problem”, SIGART Bulletin,vol. 1, no. 3, pp. 7-11, 1990.

L. Marcin, “The N queens problem – new variants of the Wirth algorithm”, Annales UMCS Informatica AI, vol.13, no. 1, pp. 53-61, 2013.

R. E. Matthias, “A Group-based Search for Solutions of n-Queens Problem”, Discrete mathematics, vol. 307, pp. 2535-2551, 2007.

V. P. Lijo and T. J. Jasmin, “Solving N-Queen Problem by Prediction”, International Journal of Computer Science and Information Technologies, vol. 6, no. 4, pp. 3844-3848, 2015.

H. S. Fazlul, R. Mostafijur and H. Baker and Asrafullah, “N-Queen Problem Revisited – A Variant of Cooperative Particle Swarm Optimization-based Solution”, International Journal of Computer Science Trends and Technology, vol. 6, no. 4, pp. 57-62, 2018.

Madhusudan and R. Rachana, “Probability-based Solution to N-Queen Problem”, International Journal of Engineering Science and Innovation Technology, vol. 3, no. 3, pp. 426-436, 2014.

R. K. Singh, V. K. Panchal and B. K. Singh B. K, “Solving N-Queen Problem Using Genetic Algorithm and Analyzing the Effort of GA Parameters on its Performance”, International Journal of Research and Analytical and Reviews, vol. 6, no. 2, pp. 680-683, 2019.

R. Igor and Z. Ramin, A dynamic programming solution to n-queens problem, Information Processing Letter vol. 41 pp. 253-256, 1992.

F. O. Ikpotokin, S. C. Chiemeke, and E. O. Osaghae, Alternative Approach to the Optimal Solution of Tower of Hanoi, Journal of Institute of Mathematics and Computer Sciences, 15 (2): 229-244, 2004.

F. O. Ikpotokin, S. C. Chiemeke, and E. O. Osaghae, Generalized Recursive Optimal Solution for the Multi-Peg Towers of Hanoi, Journal of Institute of Mathematics and Computer Sciences, 15 (2): 297-309, 2004.

S. C. Chiemeke, and E. O. Osaghae, Complete Binary Tree Implementation of Tower of Hanoi, Journal of Scientific and Industrial Studies, 4 (1): 59-65, 2006

S. C. Chiemeke, and E. O. Osaghae, “The Turning Points in The Solution of n-Queens Problem using Backtracking Method”, Journal of Nigerian Association of Mathematical Physics, vol. 2 vol. 10 pp. 107-114, 2006.

E. O. Osaghae, A. A. G. Akanmu and A. E. Akhahowa A. E. (2007). Solution to A NON-STANDARD INITIAL STATE of The Tower of Hanoi Problem, International Journal of Physical Sciences, vol. 2 vol. 1, pp. 53-61, 2017.

Downloads

Published

2021-04-04

How to Cite

Osaghae, E. (2021). Solution to n-Queens Problem: Heuristic Approach. Transactions on Engineering and Computing Sciences, 9(2), 26–35. https://doi.org/10.14738/tmlai.92.9849