Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

The N Queens Problem

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.apl.jhu.edu/~hall/java/NQueens.html
Author:Marty Hall
Description: Finding a solution to the N-Queens problem for any N greater than or equal to 4 can be done without searching. Determining where each queen should go can be done in constant time per queen, or O(N) altogether. Thus, drawing the board (which is O(N^2)) is the rate limiting step. This is demonstrated by a Java applet that lets you select an N from 4 to 60, using an algorithm from the ACM SIGART Bulletin.
Levels: College
Languages: English
Resource Types: Problems/Puzzles, Web Interactive/Java
Math Topics: Combinatorics

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.