[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Queens on a chessboard

Published: 01 December 2005 Publication History

Abstract

Can you place N queens on an NxN chessboard such that none of them will threaten the others? It is easy find such a placement for an 8x8 board. It is also simple to develop a recursive, backtracking program to produce such a placement for any N (N>3). However, the recursive execution may be very costly. Can you offer an efficient, systematic way for generating such a placement for any N?

Reference

[1]
Ginat D., On novice loop boundaries and range conceptions, 14(3), 2004, pp. 165--181.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCSE Bulletin
ACM SIGCSE Bulletin  Volume 37, Issue 4
December 2005
184 pages
ISSN:0097-8418
DOI:10.1145/1113847
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2005
Published in SIGCSE Volume 37, Issue 4

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 239
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Dec 2024

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media