chapter 11.1

Has anyone else noticed that:

solve([[c,a,b],[],[]], Sol).

given:

s(Stacks, [Stack1, [Top1 | Stack2] | OtherStacks]) :-
del([Top1 | Stack1], Stacks, Stacks1),
del(Stack2, Stacks1, OtherStacks).

del(X, [X|L], L).
del(X, [Y|L], [Y|L1]) :-
del(X, L, L1).

goal(Situation) :-
member([a,b,c], Situation).

member(X, L) :- del(X, L, _).

solve(N, [N]) :-
goal(N).
solve(N, [N | Sol1]) :-
s(N, N1),
solve(N1, Sol1).

does not actually work? I think the problem is with s - but I can't figure out what is wrong with it.

Yeah.. it seems it only uses two stacks and doesn't check for repeating states.

I've been out of the loop and in a huge project.

I've just answered 3 out of the 4 questions for my overdue Assignment 3 and probably going to submit it with only these 3 question done.

 
  ,= ,-_-. =.
 ((_/)o o(\_))
  `-'(. .)`-'
      \_/

http://ilanpillemer.com
Entia non sunt multiplicanda praeter necessitatem

ok. worked it out and submitted complete assignment a wee bit late.

 
  ,= ,-_-. =.
 ((_/)o o(\_))
  `-'(. .)`-'
      \_/

http://ilanpillemer.com
Entia non sunt multiplicanda praeter necessitatem