A new solution to the N

  • Authors:

  • C. Clay

  • Affiliations:

  • Department of GO-MOKU, University of Hard Knox, 842 Mystic Lane, Jeffersonfille, PA

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new solution to the problem of how many queens cover one chessboard. For the purposes of this paper, a Staunton style chess queen is assumed, and not the ruler of any country. This algorithm is implemented in Pidgin Algol (1), which will be demonstrated to support concurrency.