R(1)1
R(1)2
L(1)1
L(1)2
R(d)
R(d-1)
R'(d-1)
R'(d-1)
-L'(d-1)
-R(d-1)
/
-L'
-L(d-1)
R(d-1)
L(d-1)
R(d-1)
L(d)
L(d-1)
R'(d-1)
L(d-1)
-R'(d-1)
/
L
-L'(d-1)
-R'(d-1)
L'(d-1)
R(d-1)
L'(d-1)
Tessy: Recursive Tessellation Labyrinth - R(3) typically Computed.
A
B
A
B
A
B
A
B
Vertical Exit = '
Vertical Exit = '
Horizontal Exits Normal
Horizontal Exits Normal
/
/
RR
R'
R
R
L'
-R' / L
L
R'
-L'
R
Linear case, R(d) ~ R(d-1)1 above
R
L
R'
-L
-R
-L'
R
L
R