A002564 - OEIS

A002564

Number of different ways one can attack all squares on an n X n chessboard using the minimum number of queens.
(Formerly M3199 N1293)

1, 4, 1, 12, 186, 4, 86, 4860, 114, 8, 2, 8, 288, 4632, 205832, 2968, 124, 16, 84

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Number of distinct solutions to minimum dominating set on queens' graph Q(n). See A002563 for non-isomorphic solutions.

For same problem, but with non-attacking queens, see A002568. - Vaclav Kotesovec, Sep 07 2012

Number of minimum dominating sets in the n X n queen graph. - Eric W. Weisstein, Dec 31 2017

REFERENCES

W. Ahrens, Mathematische Unterhaltungen und Spiele, second edition (1910), Vol. 1, p. 301.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..19.

Andy Huchala, Python program.

Matthew D. Kearse and Peter B. Gibbons, Computational Methods and New Results for Chessboard Problems, Australasian Journal of Combinatorics 23 (2001), 253-284.

Mia Müßig, Julia code to compute the sequence

M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49.

M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 49. [Incomplete annotated scan of title page and pages 18-51]

Eric Weisstein's World of Mathematics, Minimum Dominating Set

Eric Weisstein's World of Mathematics, Queen Graph

CROSSREFS

Cf. A002563, A002568, A182333, A286883.

A075458 gives number of queens required. - Sean A. Irvine, Apr 05 2014

Sequence in context: A157404 A135704 A373394 * A287640 A322078 A019428

Adjacent sequences: A002561 A002562 A002563 * A002565 A002566 A002567

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

EXTENSIONS