solving my prolog program


I got stuck with a small prolog predicate and needs help to solove this.

The description is

getIntentions1(Options, Beliefs, Intentions, Intentions1) which has four arguments: a list of options each of the form goal(X,Y,S), a list of beliefs (here containing one term of the form at(X,Y)), the current list of intentions each of the form goal(X,Y,S), and computes a list which contains the new options inserted into the current list of intentions in order of the Manhattan distance of the goal from the agent's current location. If an option is the same distance from the agent as an existing goal, the new goal should be placed later in the list.

HERE, I have my program and it does not produce the expected output. I need help to fix this. See the attached file "[url removed, login to view]" for the code and details. The code for calculating Manhantan distance is working fine and don't need a change.

## Deliverables

1) Complete working source code - only one predicate "getIntentions1" (probably helper predicates as well).

2) Explanation pointing out to my errors.

## Platform


Compétences : Ingénierie, MySQL, PHP, Architecture Logicielle, Tests de Logiciels

En voir plus : manhattan-distance, goal engineering, change my location, solving, manhattan, fix my program, distance zip code, helper php, agent program, php prolog, small prolog program, agent engineering, php helper need, solving problem, fix errors program, distance zip, zip distance php, attached file location, small prolog, calculating order form

Concernant l'employeur :
( 2 commentaires )

Nº du projet : #3203067

2 freelances font une offre moyenne de 51 $ pour ce travail


See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(20 Commentaires)

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(15 Commentaires)