Isomorphism and the N-Queens problem

Paul Cull, R. P. (1994). Isomorphism and the N-Queens problem. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

1994

DOI

10.1145/187387.187400

Link

https://doi.org/10.1145/187387.187400

Cited by

1 citation across 1 artifact.

Domain-specific

• Burnside's lemma
  • For finite G acting on finite X, double-counting pairs in which g fixes x proves that the orbit count is |G| inverse times the sum of fixed-point counts, enabling enumeration up to symmetry.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3f521a1317cb · see in the full table