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.
+[-->-[>>+>-----<<]<--<---]>-.>>>+.>>..+++[.>]<<<<.+++.------.<<-.>>>>+.
