8-queens Solutions
Peer Review for material titled "8-queens Solutions"
User Rating for material titled "8-queens Solutions"
Member Comments for material titled "8-queens Solutions"
Personal Collections for material titled "8-queens Solutions"
Learning Exercises for material titled "8-queens Solutions"
Accessibility Info for material titled "8-queens Solutions"
Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help



Search > Material Results >

8-queens Solutions


8-queens Solutions

Logo for 8-queens Solutions
The 8-queens problem is a well-known constraint satisfaction problem (CSP) of classical AI. The task is: given a standard chessboard and 8 chess queens, place them on the board so that no queen is on the line of attack of any other queen. This problem can be easily generalized to the case of N queens on the NxN board.
Material Type: Simulation
Date Added to MERLOT: January 30, 1998
Date Modified in MERLOT: January 24, 2008
Send email to T.Takaoka@cosc.canterbury.ac.nz


  • Reviewed by members of Editorial board for inclusion in MERLOT.
    Editor Review (not reviewed)
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (2)
  • Accessibility Info (none)


Primary Audience: College General Ed
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: no
Accessiblity Information Available: no
Creative Commons: unsure


QR Code for this Page

Browse in Categories


Discussion for 8-queens Solutions

Log in to participate in the discussions or Register if you are not already a MERLOT member.

Return to Top of Page