lights out 1.1
like the previous, but with a few minor changes.
Now Investigating a certain algorithm:
first, the top row must have some clicks performed on it. then for each row, a square is clicked if the square above it is lit.
the investigation is on how the bottom row turns out based on initial permutation.
There are 8 possible end patterns:
The patterns in parentheses are a basic patter that will generate that particular end pattern.
When combined [xor] with four identity patterns 00000, 10101, 01110, 11011,
all possible start positions can be accounted for.