cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A319235 The profile of the backtrack tree for the eight queens problem.

Original entry on oeis.org

1, 8, 42, 140, 344, 568, 550, 312, 92
Offset: 0

Views

Author

Peter Luschny, Sep 15 2018

Keywords

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

Crossrefs

Cf. A000170, A319236.

Formula

a(8) = A000170(8), the number of solutions.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.