How to verify the solution to n queens problem I have made an algorithm by which I recently finished counting solutions to 28 queens problem and I have the number. How do I verify that it is correct?

I have heard that it can be done in quadratic time. That is, given a solution to an nqueen problem it can be verified in polynomial time. I would like to know the algorithm too.

Thanks
I suspect what they meant was that if you are given a placement of $n$ queens, you can verify in quadratic time whether that is a valid solution (i.e., none of the queens attack any of the others).

I don't know of any way to verify the count of the number of solutions in quadratic time, and I doubt that such a thing is possible in quadratic time.