问题
OK I am new to Prolog, so excuse me if this is something trivial, but I can't seem to find a proper elegant answer to this. I am trying to work out the exercise here on learnprolognow.org, exercise 2.4 (the crossword).
The exercise provides these facts:
word(astante, a,s,t,a,n,t,e).
word(astoria, a,s,t,o,r,i,a).
word(baratto, b,a,r,a,t,t,o).
word(cobalto, c,o,b,a,l,t,o).
word(pistola, p,i,s,t,o,l,a).
word(statale, s,t,a,t,a,l,e).
And the solution I came up with to solve the crossword placement of each word is this:
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, V1a, V1bH1b, V1c, V1dH2b, V1e, V1fH3b, V1g),
word(V2, V2a, V2bH1d, V2c, V2dH2d, V2e, V2fH3d, V2g),
word(V3, V3a, V3bH1f, V3c, V3dH2f, V3e, V3fH3f, V3g),
word(H1, H1a, V1bH1b, H1c, V2bH1d, H1e, V3bH1f, H1g),
word(H2, H2a, V1dH2b, H2c, V2dH2d, H2e, V3dH2f, H2g),
word(H3, H3a, V1fH3b, H3c, V2fH3d, H3e, V3fH3f, H3g).
With V1a
to V1g
etc. being the characters of each word, and the V1bH1b
to V3fH3f
being the characters in common between words in the crossword.
The solution seems to work, however the result is producing duplicate values, with the first result being:
?- crossword(V1, V2, V3, H1, H2, H3).
V1 = astante,
V2 = baratto,
V3 = statale,
H1 = astante,
H2 = baratto,
H3 = statale .
How can I force Prolog to have V1 \= V2 \= V3 \= H1 \= H2 \= H3
?
If I do them individually one by one I will need 120 permutations, so there must be a quicker way, and this is a beginners exercise so I must be missing something.
I found this similar question, but the answers provided seem so complicated, I hope there is a simpler way. I am using swi-prolog on Ubuntu, just in case it matters.
Thanks.
回答1:
Use alldif/1
defined like so:
alldif([]).
alldif([E|Es]) :-
maplist(dif(E), Es),
alldif(Es).
Which can be used even for the most general query:
?- alldif(Es).
Es = [] ;
Es = [_G1924] ;
Es = [_G2061, _G2064],
dif(_G2061, _G2064) ;
Es = [_G2163, _G2166, _G2169],
dif(_G2163, _G2169),
dif(_G2163, _G2166),
dif(_G2166, _G2169) ;
Es = [_G2309, _G2312, _G2315, _G2318],
dif(_G2309, _G2318),
dif(_G2309, _G2315),
dif(_G2309, _G2312),
dif(_G2315, _G2318),
dif(_G2312, _G2315),
dif(_G2312, _G2318) ...
The meaning of the goal maplist(dif(E),Es)
is best understood by looking at the answers:
?- maplist(dif(E),Es).
Es = [] ;
Es = [_G1987],
dif(E, _G1987) ;
Es = [_G2040, _G2043],
dif(E, _G2043),
dif(E, _G2040) ;
Es = [_G2093, _G2096, _G2099],
dif(E, _G2099),
dif(E, _G2096),
dif(E, _G2093) ;
Es = [_G2146, _G2149, _G2152, _G2155],
dif(E, _G2155),
dif(E, _G2152),
dif(E, _G2149),
dif(E, _G2146) ...
That is, Es
is a list of elements that are all different to E
. The goal maplist(dif(E),[A,B,C]) combines the first element (in this case dif(E)
) with each element of the list. Thus dif(E,A), dif(E,B), dif(E,C)
.
回答2:
length(List, N)
: N is the length of the listsort(List, SortedList)
: SortedList is a sorted version of List (duplicate elements are removed)
On the other hand, it may be faster to have a list of available words and remove one when it's used; not only you won't have to do the check at the end but you will avoid pointless instantiations (A1 = foo, A2 = foo
will stop immediately instead of getting rejected at the end). In other words, branch pruning.
回答3:
Either what @false told you in the comments; or I like to use domain selection:
selectM([A|As],S,Z):- select(A,S,S1),selectM(As,S1,Z).
selectM([],Z,Z).
word(astante, [a,s,t,a,n,t,e]).
word(astoria, [a,s,t,o,r,i,a]).
word(baratto, [b,a,r,a,t,t,o]).
word(cobalto, [c,o,b,a,l,t,o]).
word(pistola, [p,i,s,t,o,l,a]).
word(statale, [s,t,a,t,a,l,e]).
crossword(Words) :- findall(W, word(_,W), WS),
Words = [[ _,A,_,B,_,C,_],
[ _,D,_,E,_,F,_],
[ _,G,_,H,_,I,_],
[ _,A,_,D,_,G,_],
[ _,B,_,E,_,H,_],
[ _,C,_,F,_,I,_]],
selectM( Words, WS, _).
来源:https://stackoverflow.com/questions/14590761/force-prolog-to-choose-unique-values-of-variables