I'm trying to generate all permutations of a list subject to the constraint that there are no duplicates by rotation. So if I were doing this for lists of length 3, doing normal permutations I would get both [1, 2, 3] and [2, 3, 1]. However, [2, 3, 1] is just a rotation of [1, 2, 3] and so I don't want to include it. I could generate all permutations, loop through and remove elements that violate this constraint but this seems wasteful. How could I do this as I consider permutations, instead of considering all permutations and then removing duplicated ones? Thanks! Continue reading...
