The frogger planner (netprologo)

It is intended this work to implement the decision process of a frogger player. The frogger have to plan their actions in order to cross the road and the river 5 times in order to achieve the desired water lilies, without losing all your lives.

This game is implemented in Netlogo tool, to be used at work, and the decision component is implemented in Prolog, and the connection between the two made by Netprologo tool (an extension to incorporate in Netlogo).

Should be implemented various search algorithms (like search iterative deepening search, In-depth research in graph with limit, BFS in graph with limit) and various heuristics( like A *).

For more details, contact me!

Note: It's required to have the NetLogo software installed to run the example. (Here is the required version download url [url removed, login to view])


Habilidades: Prolog

Veja mais: url download tool, the algorithms, search algorithms in c, graph depth, graph bfs, graph algorithms in c, graph algorithms c, depth graph, c search algorithms, connection graph, bfs search, bfs graph, bfs a, algorithms graph, frogger, prolog game, game prolog, implement graph, river graph, kevin bacon iterative deepening, free version bath planner, game water, planner planner, blackbox planner, pos software chinese version

Acerca do Empregador:
( 5 comentários ) Coimbra, Portugal

ID do Projeto: #6838689

2 freelancers estão ofertando em média €55 para esse trabalho


Hello! I haven't used the nlogo, but I used prolog a lot. I have a question - what meaning do the parameters to the plano_estrada/10 & plano_rio/11 carry exactly? Nevermind, I found the calls of them in the plan-road a Mais

€60 EUR in 6 dias
(17 Comentários)

Hello Sir... I have a very good experience in prolog... please check my profile. MY PRICE IS NEGOTIABLE. Please contact me for details ASAP. Looking forward to work for you Sir. Best Regards.

€50 EUR in 5 dias
(7 Comentários)