Author:
Kholiya Gaurav,Sharma Vikrant,Vats Satvik,Garg Vijay
Abstract
N-Queen problem is a classic puzzle in which ‘N’ number of queens and a chessboard of size N X N is given. The puzzle is to lay all the given queens on the chessboard in a way that all queens are safe (i.e., no queen on the chessboard is intersecting the other queen). In this article we have proposed an algorithm to solve the N-Queen puzzle in O(N) time-complexity, without affecting the space-complexity.
Subject
General Earth and Planetary Sciences,General Environmental Science
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Face Mask Detection and Alert System;2024 International Conference on Electronics, Computing, Communication and Control Technology (ICECCC);2024-05-02
2. Detection Of Breast Tumour Using Advanced Methods;2024 2nd International Conference on Disruptive Technologies (ICDT);2024-03-15
3. Algorithmic Forex Trading: Expert Advisor Implementation of Automated Strategies;2024 2nd International Conference on Disruptive Technologies (ICDT);2024-03-15
4. Classification of Sign Language Gestures using CNN with Adam Optimizer;2024 2nd International Conference on Disruptive Technologies (ICDT);2024-03-15
5. Quantitative Insights into Breakout and Reversal Trading Strategies: A Comprehensive Analysis for Algorithmic Trading in Financial Markets;2024 2nd International Conference on Disruptive Technologies (ICDT);2024-03-15