Algorithm Assignment - Java
$30-250 USD
Pagado a la entrega
1. Implementation of A* using Graph-Search
The aim of this project is to design and implement the A* searching technique using
Graph-Search strategy. These steps should be followed:
a. Define an adequate data structure to represent each state during the search
(Node).
b. Define a data structure to represent the queue containing unexplored nodes
(fringe).
c. Write the java function to explore the state space.
2. Problem tests and evaluation
Consider the Farmer Puzzle problem; in this puzzle a Farmer, Wolf, Goat and Cabbage
arrive at a river and wish to cross. There is a boat but it can transport the farmer (only
he can row!) and at most one other object at a time. How can the farmer plan to move
his entourage from the East bank to the West bank? An additional problem is that if ever
the wolf and goat, or goat and cabbage, are left alone then one eats the other!
There are four actions in this puzzle:
Farmer goes alone (ga)
Farmer takes wolf (tw)
Farmer takes goat (tg)
Farmer takes cabbage (tc).
a. We must represent each state of the puzzle; i.e. which side of the river each of the
Farmer, Wolf, Goat and Cabbage is on. Suppose we use a 4 element list [F, W, G, C]
to represent the state and use the constants e and w to represent the east and west
banks respectively.
i. What state is represented by the list [e, e, w, w]?
ii. What are the start and goal states of the puzzle?
iii. What are the unsafe states?
iv. Draw the state space (hint: the unsafe states are not represented in
the state space).
v. Assume that the cost of each action is 1, suggest an admissible
heuristic h.
b. Solve the farmer puzzle problem using your code: display the expanded nodes, the
path solution and its cost (GUI displaying these results is appreciable).
c. Test your program on the 8-puzle problem (the initial and goal states are randomly
generated).
d. Analyze and compare your results on different heuristics (Manhattan distance,
misplaced tiles, and Gashing heuristic).
NB: The assessment of the project is based on:
The provided report describing and discussing the implementation and different
used heuristics and analyzing the obtained results.
The demonstration showing your code and its execution on some problem tests.
Nº del proyecto: #8913375
Sobre el proyecto
14 freelancers están ofertando un promedio de $166 por este trabajo
Hello I can get you this assignment ready in the next 24 to 48 hours. Do let me know if you are interested. Thanks
Hi, I have strong background in JAVA and experience in Programming. Let me help you. I am ready to start. Please send me a message so we can discuss.
Hello! We are experienced team of engineers with hundreds of reviews on this website. We have done many similar assignments before and would love to help you too, please reply back to discuss further. Thank you!
Hello, I guarantee nobody who bids on this will have a higher freelancer Java exam score, nor a more nuanced understanding of the algorithms involved. I can ace this assignment for you guaranteed in less than 7 days. I Más
Greetings! After going through your project description, I am excited to work on this project. I am experienced freelancer and fully capable to produce TOP notch work according to your requirements. Contact me to discu Más
I was a vast experience in Security domain, which encloses the implementation of various cryptographic algorithms. And currently in e-commerce domain, one gets to work and create algorithms to improve business tremendo Más
Just buy a coffee and a pizza , Programmers need to eat and drink. I will complete your project within 3 days. Thanks.
