You are here

The Non-Attacking Queens Game

Gauss found a solution to the problem of placing \(n\) queens on an \(n \times n\) chessboard so that no queen is attacked by another.

Old Node ID: 
1351
Author(s): 
Hassan Noon (Bennington College) and Glen Van Brummelen (Bennington College)
Publication Date: 
Monday, December 11, 2006
Original Publication Source: 
College Mathematics Journal
Original Publication Date: 
May, 2006
Subject(s): 
Discrete Mathematics
Game Theory
Mathematics History
Flag for Digital Object Identifier: 
Publish Page: 
Furnished by JSTOR: 
File Content: 
Rating Count: 
143.00
Rating Sum: 
407.00
Rating Average: 
2.85
Author (old format): 
Hassan Noon and Glen Van Brummelen
Applicable Course(s): 
2.7 Finite Math
4.8 History of Math
5.2 Introduction to Linear Programming
Modify Date: 
Monday, December 11, 2006
Average: 2.9 (143 votes)

Dummy View - NOT TO BE DELETED