
COMMENTS

Intuitively this is the level in the backtrack tree of the n queens problem where the algorithm spends more time than on any other level.
The constraint 'is the smallest' in the name can be dropped if the profile of the backtrack tree of the n queens problem is unimodal (for n>1).
The corresponding maxima are: 1, 1, 2, 3, 6, 14, 46, 164, 568, 2292, 9632, 44148, 222720, 1151778, 6471872, 39290462, 260303408, 1812613348, 13308584992, 102670917500.
