hmm.. i'm trying to think of an algorithm that takes a list of elements and returns a list with every way to take the elements of that list and split it up into smaller lists, so that every element is in exactly one of the smaller lists
i can't even think of a way to phrase it, let alone program it
like if i put in [1, 2, 3] i want to get out
[
[[1, 2, 3]],
[[1, 2], [3]],
[[1, 3], [2]],
[[2, 3], [1]],
[[1], [2], [3]]
]
every way to split up the input list into smaller lists
@monorail I think mathematica has a builtin for this
@Felthry do you know what it's called?
@monorail afraid not, sorry
@Felthry damn, thanks anyway
