Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Efficient N-Queen solution with Perl

by pjf (Curate)
on Nov 17, 2001 at 02:25 UTC ( #125946=note: print w/replies, xml ) Need Help??


in reply to Efficient N-Queen solution with Perl

Those poor monks who are wondering what on earth the N-Queen problem actually is, will probably be enlightened by looking here.

In sort, place N queens on an N by N chessboard, such that no queen can take any other queen.

The N-queen problem has been around for a while, as you probably guessed from the aforementioned page calling a 1977 article "recent".

Cheers,
Paul

  • Comment on Re: Efficient N-Queen solution with Perl

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://125946]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (4)
As of 2016-10-01 20:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?






    Results (7 votes). Check out past polls.