Freaks City

Segment Rotation Optimization When solving permutation puzzles that require rearranging contiguous segments within a fixed array, the branching factor can grow exponentially. For an array of length $n$, selecting a segment of length $i$ yields $n-i+1$ starting positions and $n-i$ insertion points. Accounting for symmetry (forward vs. backward m ...