 This method ensures that each fixed polyomino is counted exactly "n" times, once for each starting square.It can be optimized so that it counts each polyomino only once, rather than "n" times.Starting with the initial square, declare it to be the lower-left square of the polyomino.