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.
Hello
I'm interesting your project very well
I'm a Good Java, Math, Algorithm expert.
I understand your req exactly.
I m quite well experienced in these jobs.
Let's go ahead with me
I want to service for you continously.
Thanks
Hello
I am Java and Algorithm expert and interested in this project. I have reviewed the requirements carefully and confident to handle this project perfectly. I also have a lot of experience in helping students with assignments.
Please communicate to discuss further.
Regards
Anshu
Hi there!
I worked with different search algorithms and Advanced Data Structures, Please see my profile for details of my previous done projects in Java. I read your description properly and I'll solve the Farmer Puzzle using AStar Search and more importantly I'll deliver in one day. Please consider me for this Job.
Thanks a lot!
Maher
I am an IITK graduate, an experienced software professional and I have got top notch developers in my team, who have got experience across a span of technologies. The team members in my team have worked with top notch tech organization such as Amazon, Cisco, Oracle etc. We have been involved in similar projects in the past and our track record has been excellent.
hello
i am a PhD in computer science and engineering.
i can do this algorithm task perfectly.
i can give you a sample solution(message me for that).
thanks
I am a math and computer science undergraduate in CMI, I have been to ICPC world finals and have also participated in Round 3 of Google CodeJam. I specialize in Search Algorithms and have recently worked on Informed Search.
I my self is in expert in algorithm and Java. I also teach this course in local school.
My teammate also graduated in Computer Science, including AI. He's also teaching this course in university.
I can help you complete this task with best quality.