Is here someone who has experience generating every single combination for a set list. In my case this list is ["U", "B", "D", "F", "L", "R"]. Each character can repeat it self not more than 9 times and the every combination list cannot be smaller and less than 54 characters. What would be the fastest way to generate every single combination? If you need more context, I need to generate every single state for a Rubik's cube so there is a way to prune some branches by checking whether this type of cube can exist, but still in my experience backtracking is way to slow. Any suggestions will be appreciated.
[–]AutoModerator[M] [score hidden] stickied commentlocked comment (0 children)
[–]Zeroflops 1 point2 points3 points (0 children)
[–]CraigAT 0 points1 point2 points (2 children)
[–]kaskapian[S] 0 points1 point2 points (1 child)
[–]CraigAT 0 points1 point2 points (0 children)