Green's Open Problems #97

### What is the conjecture
https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.97

In how many ways (asymptotically) $Q(n)$ may $n$ non-attacking queens be placed on an $n \times n$ chessboard?

### [AMS categories](https://github.com/google-deepmind/formal-conjectures/labels?q=ams-)

* ams-05

### Choose either option
- [ ] I plan on adding this conjecture to the repository
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Start with Problem 97 in the linked Green PDF and review how this repository represents formalized conjectures. The work is complete when the non-attacking-queens asymptotic conjecture is added as a Lean statement and accepted by the project's checks.

Written by the indexing model from the issue text.