How can you find the biggest free square in a 2D map with obstacles?
This article shows how to solve the N queens problem in 20 lines of code.
I know a proof that there's irrational numbers that one to the power of the other give a rational number and this footer is almost the right size for it.
