Correspondence: Response to "Explicit Solutions to the N-Queens Problem for all N"

Authors:
Marco Valtorta
Affiliations:
University of South Carolina mgv@usceast.cs.scarolina.edu
Venue:
ACM SIGART Bulletin
Year:
1991

Citing 6
Cited 0

A fast algorithm for the towers of Hanoi problem

The Computer Journal
Divide and conquer under global constraints: a solution to the N-queens problem

Journal of Parallel and Distributed Computing
A polynomial time algorithm for the N-Queens problem

ACM SIGART Bulletin
Explicit solutions to the N-queens problem for all N

ACM SIGART Bulletin
On a general framework for large-scale constraint-based optimization

ACM SIGART Bulletin
3,000,000 Queens in less than one minute

ACM SIGART Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dear Dr. Johnson:I read with interest the correspondence regarding the N-Queen problem in the April 1991 issue of the SIGART Bulletin, including your comments in the "Letter from the Editor." I would like to contribute some additional considerations.