login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319235 The profile of the backtrack tree for the eight queens problem. 1
1, 8, 42, 140, 344, 568, 550, 312, 92 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The profile (p_0, p_1, ..., p_n) is the number of nodes at each level of the tree.

The backtrack tree as defined by Knuth has for the eight queens problem 2057 nodes.

REFERENCES

D. E. Knuth, The Art of Computer Programming, Volume 4, Pre-fascicle 5B, Introduction to Backtracking, 7.2.2. Backtrack programming. 2018.

LINKS

Table of n, a(n) for n=0..8.

Wikipedia, Backtracking

Wikipedia, Eight queens puzzle

FORMULA

a(8) = A000170(8), the number of solutions.

CROSSREFS

Cf. A000170, A319236.

Sequence in context: A292059 A027903 A231069 * A341764 A256861 A287221

Adjacent sequences:  A319232 A319233 A319234 * A319236 A319237 A319238

KEYWORD

nonn,fini,full

AUTHOR

Peter Luschny, Sep 15 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 11:48 EST 2021. Contains 349563 sequences. (Running on oeis4.)