Search
Classroom Capsules and Notes
send to a friend
The Non-Attacking Queens Game
by Hassan Noon and Glen Van Brummelen
This article originally appeared in:College Mathematics Journal
May, 2006
Subject classification(s): Discrete Mathematics | Game Theory | Mathematics History
Applicable Course(s): 2.7 Finite Math | 4.8 History of Math | 5.2 Introduction to Linear Programming
Gauss found a solution to the problem of placing n queens on an nxn chessboard so that no queen is attacked by another.
A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.
To open this file please click here.
These pdf files are furnished by JSTOR.
Capsule Course Topic(s):
To rate this capsule on a 1-5 scheme, click on the appropriate icosahedron:
 | |  |  | | Current rating: 2.8 | number of votes: 142 | |
| 1 | 2 | 3 | 4 | 5 |