 However, it is faster to generate symmetric polyominoes separately (by a variation of this method) and so determine the number of free polyominoes by Burnside's lemma.The most modern algorithm for enumerating the fixed polyominoes was discovered by Iwan Jensen.An improvement on Andrew Conway's method, it is exponentially faster than the previous methods (however, its running time is still exponential in "n").