Abstract
The n-queens problem is to determine in how many ways n queens may be placed on an n-by- n chessboard so that no two queens attack each other under the rules of chess. We describe a simple O(ƒ( n)8 n ) solution to this problem that is based on dynamic programming, where ƒ( n) is a low-order polynomial. This appears to be the first nontrivial upper bound for the problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
