Miro
Member
- Joined
- Dec 29, 2015
- Messages
- 33
In my first question I asked for like-Uperm algorithm, which not prevent corners permutation. So maybe 3-gen algorithm which not prevent corners permutation is easier than Uperm, which prevent corners permutation. But Cube Explorer say there is nothing better than Uperm.How could something 3-gen be less complex than a 2-gen U perm?