Tidal's shuffle plays a random permutation of a pattern's parts (without replacement); scramble picks parts with replacement

Both shuffle n p and scramble n p divide pattern p into n equal parts and reorder them anew each cycle. The difference is sampling without vs. with replacement. shuffle returns a random permutation: each part appears exactly once per cycle, so the set of events is preserved and only their order changes. scramble selects the parts at random with replacement: any part may appear multiple times or not at all, so it can repeat and omit events. Consequently shuffle gives subtle, predictable reordering that keeps every hit, while scramble gives more chaotic variation that can drop or repeat material. For n parts over many cycles, each part still appears once per cycle under shuffle but averages once per cycle (with high variance) under scramble.

Examples

d1 $ sound $ shuffle 3 "bd sn hh"   -- e.g. "sn bd hh", never "bd sn bd"
d1 $ sound $ scramble 3 "bd sn hh"  -- can produce "bd sn bd" or "hh hh hh"

Assessment

A pattern has parts A B C. After shuffle 3, which outputs are possible? After scramble 3, which additional outputs become possible? Over 8 cycles, how many times does each part appear on average under each function, and when would you prefer shuffle over scramble?