Data commit

Task/Permutations/Prolog/permutations-1.pro

@@ -0,0 +1,7 @@
+:- use_module(library(clpfd)).
+
+permut_clpfd(L, N) :-
+    length(L, N),
+    L ins 1..N,
+    all_different(L),
+    label(L).

Task/Permutations/Prolog/permutations-2.pro

@@ -0,0 +1,8 @@
+?- permut_clpfd(L, 3), writeln(L), fail.
+[1,2,3]
+[1,3,2]
+[2,1,3]
+[2,3,1]
+[3,1,2]
+[3,2,1]
+false.

Task/Permutations/Prolog/permutations-3.pro

@@ -0,0 +1,7 @@
+% permut_Prolog(P, L)
+% P is a permutation of L
+
+permut_Prolog([], []).
+permut_Prolog([H | T], NL) :-
+	select(H, NL, NL1),
+	permut_Prolog(T, NL1).

Task/Permutations/Prolog/permutations-4.pro

@@ -0,0 +1,8 @@
+ ?- permut_Prolog(P, [ab, cd, ef]), writeln(P), fail.
+[ab,cd,ef]
+[ab,ef,cd]
+[cd,ab,ef]
+[cd,ef,ab]
+[ef,ab,cd]
+[ef,cd,ab]
+false.

Task/Permutations/Prolog/permutations-5.pro

@@ -0,0 +1,5 @@
+insert(X, L, [X|L]).
+insert(X, [Y|Ys], [Y|L2]) :- insert(X, Ys, L2).
+
+permutation([], []).
+permutation([X|Xs], P) :- permutation(Xs, L), insert(X, L, P).