16.2 Time Complexity

**strat0sphere** · August 16, 2017, 1:08am

Can anyone explain the n!/c^n complexity with c=2.54 on this problem?

**tsunghsienlee** · September 7, 2017, 5:11pm

Here we just show the number of possible n-queens placements for any value of n. Because the number of n-queens placements is actually the lower bound of the time complexity.

**strat0sphere** · September 13, 2017, 6:47pm

Thanks @tsunghsienlee - I was mostly confused with the constant “2.54” - by doing further research I now understand where this comes from.
Here is a related link that other readers might find useful: http://jair.org/media/5512/live-5512-10126-jair.pdf

**tsunghsienlee** · September 14, 2017, 3:46am

I think we were showing-off a little bit at the time we wrote the time complexity part as it is very hard to analyze that but I think it is still good to know people actually tried to understand the lower bound of n-queens.