|
|
Author:
Prof. Tadao Takaoka 
|
|
|
|
|
| Description: |
|
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.
|
|
|
Browse in Categories:
|
|
|
|
| More information about this material: |
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
Copyright:
yes
Creative Commons:
unsure
|
