I need someone to create a prolog search algorithm that uses depth-first search, breadth-first search, and the best first search in prolog using the london underground stations as the database.
Do you have a fixed heuristics for best first search (distance between tube stations or something)? That one is informed. Or should it be implemented for a generic heuristics? Prolog is not great for genericity. Anyway, I can solve it for you. Let me know if you feel I can help.
£28 GBP 4 napon belül
0,0 (0 értékelés)
0,0
0,0
3 szabadúszó adott átlagosan £39 GBP összegű árajánlatot erre a munkára
Hello!
I am ready to carry out your project in the reasonable price and in the shortest possible time and with the highest quality!
You can read reviews about my work at: https://www.freelancer.com/u/VladimirLilenko?w=f
From the Prolog, of course, familiar.
Regards,
Vladimir
Hello,
I use Prolog programming daily in my regular employment. I will prepare these searches for you in Prolog. I will be using SWI Prolog. You must provide the database.
OK. Your searches are DONE. I had the depth first search and best first searches done earlier in the week. Now the breadth first search is done as well.
A milestone payment for the full budget for this project must be deposited with this site before your offer can be accepted.
Alan Idler
Chief Software Architect
Idleswell Software Creations