- permute_sum_of_int(+N:nonneg, -Integers:list(integer)) is nondet
- Permute sum. Non-deterministically finds all combinations of integer
sums between 1 and N. Assumes that 0<=N. The number of possible
permutations amounts to 2-to-the-power of N-1; for N=3 there are
four as follows: 1+1+1, 1+2, 2+1 and 3.
- permute_list_to_grid(+List0:list, -List:list(list)) is nondet
- Permutes a list to two-dimensional grid, a list of lists. Given an
ordered List0 of elements, unifies List with all possible rows of
c for example, permutes three rows of
a in the first row with
c in the second; then
b in the first row,
c alone in
the second; finally permutes
c on a single row.
Permutations always preserve the order of elements from first to