Alsamoshelan
Member
- Joined
- Aug 29, 2018
- Messages
- 8
Hello everyone,
I study the period of algorithms.
Period basics
Let A be an algorithm. A is "k-periodic" if A^k (A repetead k times) is the equivalent of doing nothing.
For instance, (RUR'U') is 12-periodic, 36-periodic, and its smallest period is 6.
What I'm looking for
I'm searching algorithms whose smallest period is 11 and whose height (HTM) is as small as possible.
Currently I found this one (with a program), its height is 10 :
D' L R' F U' R U' D F' L
But maybe there are smaller algorithms. That's why I need some help. If anybody find such an algorithm with a height <= 10, please let me know !
Important fact for the search
An algorithm whose smallest period is 11 must be a 11-edges cycle.
Thank you.
I study the period of algorithms.
Period basics
Let A be an algorithm. A is "k-periodic" if A^k (A repetead k times) is the equivalent of doing nothing.
For instance, (RUR'U') is 12-periodic, 36-periodic, and its smallest period is 6.
What I'm looking for
I'm searching algorithms whose smallest period is 11 and whose height (HTM) is as small as possible.
Currently I found this one (with a program), its height is 10 :
D' L R' F U' R U' D F' L
But maybe there are smaller algorithms. That's why I need some help. If anybody find such an algorithm with a height <= 10, please let me know !
Important fact for the search
An algorithm whose smallest period is 11 must be a 11-edges cycle.
Thank you.