VARIANTA I

a) X, Z=a, Y=b sau X=a, Y, Z=b

b) X=a, Y =b
c) X=b, Y, Z =a sau X,Z =b, Y=a
d) X=a, Y=b
e) false

a) a(bcd)nefm , n≥ 1 , m ≥ 2, n-impar, m-par

b) abcdeff
c) a bcd bcd bcd bcd e f f f f f f

sort([],L,L).
sort(L,[],L).
sort([Head1|Tail1], [Head2|Tail2], L) :-
Head1 < Head2 -> L = [Head1|R], sort(Tail1,[Head2|Tail2],R) ;
Head1 > Head2 -> L = [Head2|R], sort([Head1|Tail1],Tail2,R) ;
L = [Head1,Head2|R], sort(Tail1,Tail2,R).
O varianta de baza al jocului: Jucator 1 ia 2 bile, Jucator 2 ia 1 bila, Jucator 1 ia
2 bile. Jucator 1 a castigat.

Starea la oricare moment dat reprezinta valoarea lui N.

Starea initiala e N=8.
Starea scop N=3.
Stari terminale N<0, N>10.
Reguli de trecere:
a) N=N+2
b) Daca N-par, N=N/2