Bit-vector encoding of n-queen problem

  • Authors:

  • Qiu Zongyan

  • Affiliations:

  • Peking University, Beijing, CHINA

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

8-queen problem and its generalization, n-queen problem are well-known examples in the textbooks on elementary programming, data structures, and algorithms. Different methods are proposed to solve these problems, for example, in [1]. In this paper, we present a purely bit-vector encoding of the n-queen problem. It is very natural, simple to understand, and efficient. It involves only bit-wise operations.