Started by increasing the outer size from 3 up to the upper limit, which is found as the case of a single row of tiles all the way around, like in the example picture on the right of the problem page. The inner hole begins as large as possible, and decreases until it runs out of tiles.
Runtime: 0.016 seconds