A heuristic based linear time O(N) novel solution to N-Queen problem
Gaurav Kholiyagauravkholiya.21011206@gehu.ac.inComputer Science & EngineeringGraphic Era Hill UniversityDehradun, Uttarakhand, IndiaView full profile → , *Vikrant SharmaCorresponding authorvsharma@gehu.ac.inComputer Science & EngineeringGraphic Era Hill UniversityDehradun, Uttarakhand, IndiaView full profile → , Satvik Vatssvats@gehu.ac.inComputer Science & EngineeringGraphic Era Hill UniversityDehradun, Uttarakhand, India0000-0002-9422-4915View full profile → , Vijay Gargvijay.garg@lpu.co.inSchool of Computer Science & EngineeringLovely Professional UniversityPunjab, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Published Online:
- 11 Nov 2023
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1440
- Pages:
- 1087–1096
Abstract
Keywords
Subject Classifications
References
[1] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms. MIT press (2022).
[2] Jain, M. K. Bohra, M. K. Sharma, and V. G. Shankar, “A modi¬fied cuckoo search for the N-Queens problem,” in Data Engineering for Smart Systems: Proceedings of SSIC 2021, pp. 615–620 (2022).
[3] R. M. Haralick and G. L. Elliott, “Increasing tree search efficiency for constraint satisfaction problems,” Artif. Intell., vol. 14, no. 3, pp. 263–313 (Oct. 1980), doi: 10.1016/0004-3702(80)90051-X.
[4] J. Bell and B. Stevens, “A survey of known results and research areas for N-Queens,” Discrete Math., vol. 309, no. 1, pp. 1–31 (Jan. 2009), doi: 10.1016/J.DISC.2007.12.043.
[5] L. E. Mou-hua, L. I. Wei-Xuan, and E. T. Wang, “A generalization of the N-Queen problem,” J. Syst. Sci. Math. Sci., vol. 9, no. 2, p. 158 (1989).
[6] O. Demiroers, N. Rafraf, and M. M. Tanik, “Obtaining N-Queens solutions from magic squares and constructing magic squares from N-Queens solutions,” J. Recreat. Math., vol. 24, no. 4, pp. 272–280 (1992).
[7] H. Izadkhah, “Backtracking Algorithms,” in Problems on Algorithms: A Comprehensive Exercise Book for Students in Software Engineering, Springer, pp. 487–496 (2022).
[8] E. Horowitz, Fundamentals of computer algorithms. Galgotia Publications (1978).
[9] R. Sosic and J. Gu, “A polynomial time algorithm for the N-Queens problem,” ACM SIGART Bull., vol. 1, no. 3, pp. 7–11 (1990).
[10] B. Abramson and M. Yung, “Divide and conquer under global constraints: A solution to the N-Queens problem,” J. Parallel Distrib. Comput., vol. 6, no. 3, pp. 649–662 (Jun. 1989), doi: 10.1016/0743-7315(89)90011-7.
[11] S. Khan, M. Bilal, M. Sharif, M. Sajid, and R. Baig, “Solution of n- Queen problem using ACO,” INMIC 2009 - 2009 IEEE 13th Int. Multitopic Conf. (2009), doi: 10.1109/INMIC.2009.5383157.
[12] K. Agarwal, A. Sinha, and M. Hima Bindu, “A novel hybrid approach to N-Queen problem,” Adv. Intell. Soft Comput., vol. 166 AISC, no. VOL. 1, pp. 519–527 (2012), doi: 10.1007/978-3-642-30157-5_52/COVER.
[13] Z. Wang, D. Huang, J. Tan, T. Liu, K. Zhao, and L. Li, “A parallel algorithm for solving the N-Queens problem based on inspired computational model,” Biosystems, vol. 131, pp. 22–29 (May 2015), doi: 10.1016/J.BIOSYSTEMS.2015.03.004.
[14] R. Jha, D. Das, A. Dash, S. Jayaraman, B. K. Behera, and P. K. Panigrahi, “A novel quantum N-Queens solver algorithm and its simulation and application to satellite communication using IBM quantum experience,” arXiv Prepr. arXiv1806.10221 (2018).
[15] H. Ahrabian, A. Mirzaei, and A. Nowzari-Dalini, “A DNA Sticker Algorithm for Solving N-Queen Problem.,” Int. J. Comput. Sci. Appl., vol. 5, no. 2, pp. 12–22 (2008).
[16] S. Mukherjee, S. Datta, P. B. Chanda, and P. Pathak, “Comparative study of different algorithms to solve N queens problem,” Int. J. Found. Comput. Sci. Technol, vol. 5, no. 2, pp. 15–27 (2015).
[17] Su, T. S., Wu, C. C., & Chang, L. W. : Integration of audio surveillance on a queen bee rearing and breeding management system. Journal of Information and Optimization Sciences, 42(4), 719-734 (2021).
[18] Tang, H. C., Hsieh, K. H., & Chao, T. L. : A backward heuristic algorithm for two-term multiple recursive random number generators. Journal of Discrete Mathematical Sciences and Cryptography, 13(6), 593-600 (2010).
[19] Reddy, V. D., & Rao, G. S. V. R. K. : Meta-heuristic approaches to solve shortest lattice vector problem. Journal of Discrete Mathematical Sciences and Cryptography, 24(1), 81-91 (2021).
[20] Chen, W. J., Lin, S. M., & Tsou, J. C. : Sequencing heuristic for bicriteria scheduling in a single machine problem. Journal of Information and Optimization Sciences, 27(2), 459-468 (2006).
[21] Vimala Rani, M., & Mathirajan, M. : Performance evaluation of ATC based greedy heuristic algorithms in scheduling diffusion furnace in wafer fabrication. Journal of Information and Optimization Sciences, 37(5), 717-762 (2016).
[22] Chiang, C. P. : An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines. Journal of Information and Optimization Sciences, 26(1), 193-204 (2005).
[23] Kumar, A., Singh, K., & Khan, T. : L-RTAM: Logarithm based reliable trust assessment model for WBSNs. Journal of Discrete Mathematical Sciences and Cryptography, 24(6), 1701-1716 (2021).
[24] Khan, T., & Singh, K. : Resource management based secure trust model for WSN. Journal of Discrete Mathematical Sciences and Cryptography, 22(8), 1453-1462 (2019).
[25] Shariq, M., Singh, K., Lal, C., Conti, M., & Khan, T.: ESRAS: An ef¬ficient and secure ultra-lightweight RFID authentication scheme for low-cost tags. Computer Networks, 217, 109360 (2022).
[25] Kumar, A., Singh, K., Khan, T., Ahmadian, A., Saad, M. H. M., & Manjul, M. : ETAS: An efficient trust assessment scheme for BANs. IEEE Access, 9, 83214-83233 (2021).
