You are here

The Non-Attacking Queens Game

by Hassan Noon (Bennington College) and Glen Van Brummelen (Bennington College)

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 \(n \times n\) 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.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Average: 2.9 (143 votes)