Abstract
A non-deterministic algorithm produces a diverse result even using the same input. These problems are classified as NP-class problems, and the N-Queens problem is one of them. In n × n chessboard, placement of queens follows the pattern of permutation; i.e., each queen must be settled on different row and column. The N-Queens problem involves placing n numbers of queens in such a way that no two queens attack one other in the same row, column, or diagonal location, also known as the NP-class problem. To put it in a simple way, we can say that no two queens have the same row, column, or diagonal. In the past, a variety of strategies were employed to find solutions to the N-Queens problem, each with its own set of complexity and drawbacks. In this research, a new hybrid crossover operator is used for solving the N-Queens problem with sizes ranging from 4 to 12.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Khan S, Bilal M, Sharif M, Sajid M, Baig R (2009) Solution of n-queen problem using ACO. In: 2009 IEEE 13th international multitopic conference, pp 1–5
Martinjak I, Golub M (2007) Comparison of heuristic algorithms for the n-queen problem. In: 2007 29th international conference on information technology interfaces, pp 759–764
Bell J, Stevens B (2009) A survey of known results and research areas for n-queens. Discrete Math 309:1–31
Bozikovic M, Golub M, Budin L (2003) Solving n-Queen problem using global parallel genetic algorithm. In: The IEEE region 8 EUROCON 2003. Computer as a tool, pp 104–107
Hitesh PVK, Goyal H (2011) On some aspect of genetic algorithm and N-Queen problem. Int J Comput Inf Syst 2:1–41
Prasad KBJ, Yadav SK (2012) Intelligent heuristic search algorithm for N Queens problem of constraint satisfaction. Int J Comput Sci Netw (IJCSN) 1
Thada V, Dhaka S (2014) Performance analysis of N-Queen problem using backtracking and genetic algorithm techniques. Int J Comput Appl 102
Bashir LZ, Mahdi N (2015) Use genetic algorithm in optimization function for solving queens problem. World Sci News 138–150
Farhan AS, Tareq WZ, Awad FH (2015) Solving N queen problem using genetic algorithm. Int J Comput Appl 122
Talnikar H, Pansare S (2017) An approach to solve n-Queens problem using genetic algorithm. IJARIIE 3(2)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Garg, P., Chauhan Gonder, S.S., Singh, D. (2022). Hybrid Crossover Operator in Genetic Algorithm for Solving N-Queens Problem. In: Kumar, R., Ahn, C.W., Sharma, T.K., Verma, O.P., Agarwal, A. (eds) Soft Computing: Theories and Applications. Lecture Notes in Networks and Systems, vol 425. Springer, Singapore. https://doi.org/10.1007/978-981-19-0707-4_10
Download citation
DOI: https://doi.org/10.1007/978-981-19-0707-4_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0706-7
Online ISBN: 978-981-19-0707-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)