building a predicate 'is_top'

[waqas246]

Hi,
how can i build a predicate to find the top card of a deck of cards. e.g

card(desk,a).
card(a,b).
card(b,c).
card(c,d).
card(d,e).
--------------------------
?- is_top(T).
T = e
Yes
?- is_top(d).
No

 

[joel76]

At first glance, you can fetch all the Y of card(X,Y) and top is the last of the list.

 

[nn987]

hi

create a list with all the elements.
reverte the list and the top is the on the head

I don´t know if you can use predicates pre defined like "findall, reverse,head"


Ricardo

 

[nn987]

Hi

no need to of complicate.
You need put all in to a list. and write the predicate LAST

nn987

 

[nn987]

%first put into a list
lstCard(C):-findall(Y,card(_,Y),C).

%the last element of the list
lastb([]):-!,fail.
lastb([E],E):-!.
lastb([_|T],L):-lastb(T,L).

%is_top(e).
is_top(L):-lstCard(C),lastb(C,L).

 

[joel76]

There is another way with assert/retract :

is_top(X) :-
	forall(card(_, Y), (retractall(a(_Y)), assert(a(Y)))),
	retract(a(X)).