Labyrinth Switch Puzzle

(More involved math:)

Let's define m1...m7 as above.
Now define ni = m(i)+ m(i+1).

Thus, n1 = 1001
n2 = 01001
...
n4 = 0001001

We can see that adding n3 + n6 gives us:
00100100+
10000100
=
10100000

Adding m1 to this gives

10100000+
11100000
=
01000000

This gives us the pattern to flip a single pillar at position 1, as detailed above.

-----------------
However, we can also use another useful pattern.
the n patterns let us flip two pillars with two spaces between them, but we can define the h series similarly:

hi = n(i)+(ni+3)=m(i)+m(i+1)+m(i+3)+m(i+4)
So h1 = 10000010
and h3 = 10100000

So the h pattern gives us a way to flip two pillar which are separated by a single pillar.


The last post above was derived using this process as h3 + m1.

"

Sinthetick wrote:

http://www.poelab.com/puzzle-solutions/

Ah, I didn't see that in my google search for solutions, so I thought I'd post my math for other folks. Thank you for the link.