Re: Prolog problem


"Martijn Smeets" <info[at]msphotographics.nl> wrote in message
news:435725fa$0$158$3a628fcd@xxxxxxxxxxxxxxxxxxxxxxxxx
>
> "A.L." <alewando@xxxxxxxxxxxxxx> wrote in message
> news:bjpdl1h1ldeqsnv11oglarthdgvhn54lnt@xxxxxxxxxx
>> On Wed, 19 Oct 2005 21:03:50 +0200, "Martijn Smeets"
>> <info[at]msphotographics.nl> wrote:
>>
>>>I have the following prolog problem, I just don't know how to solve..
>>>I hope somebody is able to help me out...
>>>
>> [...]
>>>
>>>Who's able to write such a programm. I guess it shouldn't be too hard,
>>>but
>>>I'm just not good at prolog. I have to have a solution by this weekend.
>>
>> What university?...
>
> Does it matter?
>
> this is what I have so far:
>

There was one error here:

> try(From,Takken,To,Knopen,Tour):-
> Takken = [_|TT],
> try(From,TT,To,Knopen,Tour).


Sorry, another error here:

> laststep(From,Tour,Takken) :-
> Takken = [_|TT],
> laststep(From,Tour,TT).

Martijn


.

Relevant Pages

  • Re: Prolog problem
    ... >I have the following prolog problem, I just don't know how to solve.. ... > A program that checks a Directed Graph if there's a cycle that ends at ... Martijn ... Prev by Date: ...
    (comp.lang.prolog)
  • Re: Prolog problem
    ... >>I have the following prolog problem, I just don't know how to solve.. ... I cant use if-then's, and disjunctions by with; ... Martijn ... Prev by Date: ...
    (comp.lang.prolog)