Hello!
I looked into oscar.py - it handles most patterns well by checking and comparing the hash vale of the patterns at various generations.
However, since the algorithm checks the entire pattern, it fails when the pattern stabilise but keeps changing at the same time. The most obvious example is spaceships flying in different directions and the R-pentomino.
I am wondering whether there exists easy way to check the number of generations it takes for a given initial pattern to stabilise! Thank you! : )