The n-queens problem is about finding how many different ways queens can be placed on a chessboard so that none attack each other.

Following our paper, we now understand that the reason why the n-queens completion problem is so much harder than the version with an empty board is that it is an example of an NP-complete problem.