N-queens problem

The n-queens problem is that of placing n queens on an n × n chess board so that none of the queens can attack each other.

The problem is often used in teaching algorithms and data structures in computer science.

Here is an example of 8 queens on the traditional 8×8 board:

External links

This article needs expanding, including a sample solution.

This article is a stub. You can help Wikipedia by expanding it (http://www.thebestlinks.com/N__MM__queens_problem-bp-action-v-edit-ep-.html).

Last posted 0 of 0 messages

[no messages posted yet]

>> post message >>

You can add this article to your own "watchlist" and receive e-mail notification about all changes in this page.