A352663 Number of asymmetric characteristic solutions to the n-superqueens problem.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 18, 231, 642, 4040, 25320, 166201, 1115373, 8060958, 61981118, 497224414
Offset: 1
Examples
One of the a(11)=5 solutions is +-----------------------+ | A . . . . . . . . . . | | . . . . A . . . . . . | | . . . . . . . . A . . | | . A . . . . . . . . . | | . . . . . A . . . . . | | . . . . . . . . . A . | | . . A . . . . . . . . | | . . . . . . A . . . . | | . . . . . . . . . . A | | . . . A . . . . . . . | | . . . . . . . A . . . | +-----------------------+ and the other four are obtained by wraparound shifts.
References
- D. E. Knuth, The Art of Computer Programming, Section 7.2.2.3 (draft, March 2022).