Solution #1: solution([]). solution([X/Y|Others]) :- solution(Others), member(Y, [1,2,3,4,5,6,7,8]), noattack(X/Y, Others). noattack(_,[]). noattack(X/Y,[X1/Y1|Others]) :- Y =\= Y1, Y1 - Y =\= X1 - X, Y1 - Y =\= X - X1, noattack(X/Y,Others). member(Item,[Item|Rest]). member(Item,[First|Rest]) :- member(Item,Rest). template([1/Y1,2/Y2,3/Y3,4/Y4,5/Y5,6/Y6,7/Y7,8/Y8]). Solution #2: solution(Queens) :- permutation([1,2,3,4,5,6,7,8], Queens), safe(Queens). permutation([],[]). permutation([Head|Tail],PermList) :- permutation(Tail,PermTail), del(Head,PermList,PermTail). del(Item,[Item|List],List). del(Item,[First|List],[First|List1]) :- del(Item,List,List1). safe([]). safe([Queen|Others]) :- safe(Others), 

noattack(Queen,Others,1). noattack(_,[],_). noattack(Y,[Y1|Ylist],Xdist) :- Y1-Y=\=Xdist, Y-Y1=\=Xdist, Dist1 is Xdist + 1, noattack(Y,Ylist,Dist1). Solution #3: solution(Ylist) :- sol(Ylist,[1,2,3,4,5,6,7,8], [1,2,3,4,5,6,7,8], [-7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7], [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]). sol([],[],[],Du,Dv). sol([Y|Ylist],[X|Dx1],Dy,Du,Dv) :- del(Y,Dy,Dy1), U is X-Y, del(U,Du,Du1), V is X+Y, del(V,Dv,Dv1), sol(Ylist,Dx1, Dy1,Du1,Dv1). del(Item,[Item|List],List). del(Item,[First|List],[First|List1]) :- del(Item,List,List1). 输出: ?- findall(S, solution(S), LS), length(LS,N), write(N). 92