Optimizing the Eight Queens Overlay Problem
A study of the old problem of how to place eight queens on a chess board so that no queen attacks any of the others. This Paper studies the overlay problem: How can the 12 basic solutions to the above be shown on one chess board with a minimum of crowding? The scheme suggested reduces the multi-stage decision process to a series of single-stage decisions, each with a simple criterion of success.
- Format:
- Paperback, 10 Pages
- Year:
- 1965
- List Price:
- $20.00
- Price:
- $16.00 Special 20% Web Discount
- Full Document (pdf format) (File size 0.3 MB)
Use Adobe Acrobat Reader version 7.0 or higher for the best experience.
Document Details
- Copyright: RAND Corporation
- Availability: Available
- Format: Paperback
- Pages: 10
- List Price: $20.00
- Price: $16.00
- Document Number: P-3102
- Year: 1965
- Series: Papers
This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.
RAND® is a registered trademark. Copyright © 1994-2012 RAND Corporation.