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.
Think of a number between 1 and 10. Multiply it by 9 and subtract 1. Now close your eyes. It got dark, didn't it?
