N-Queens¶

Description¶

Five encodings of the n-queens problem, reflecting encoding improvements. Instances "generated" by varying constant n.

Usage:¶

Example call:

clingo <encoding.lp> -c n=<n>

Metadata¶

Technical Details¶

• Type: Decision
• Format: clingo
• Tested With: clingo 5.7.1

Instances¶

• Generation: Vary the constant n
• Details: Arbitrarily scalable

Data & Access (Confidentiality)¶

• Status: Public
• License: None
• Sensitivity: None

Source & Literature¶

• Repository/ZIP: Attached file
• Reference:
  Section 8.1 Pimping Queens in: Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer Set Solving in Practice. Morgan & Claypool Publishers.

Contact¶

• Name: Torsten Schaub
• Email: torsten@cs.uni-potsdam.de

Miscellaneous¶

• Complexity:
  Specific mathematical constructions can find one solution in linear time, otherwise nicely combinatorial
• Other Notes:
  Solver tuning may advance performance

Download¶

In the future you will be able to download the benchmark set here.