Urgent and I mportant - Path Planning and Maze Search - Dijkstra's Algorith

Hi,

I've an assignment at hand which I would like you to have a look at to see.

Basically it's using Dijkstra's Algorithm and futher information could be obtain here...

http://www.cse.unsw.edu.au/~cs2011/lect/ShortestPath.pdf

As for information of the assignment, pls refer to

http://www.cse.unsw.edu.au/~cs2011/hw4/

For the sample output as in below link, please follow the exact format for the program.

http://www.cse.unsw.edu.au/~cs2011/hw4/samples/

The FAQs asked by some of the students:

http://www.cse.unsw.edu.au/~cs2011/hw4/faq.shtml

I had a bad encounter with a few of the programmers here, hope you'll understand.

Regards

[708 byte] By [waelsalmana] at [2007-9-28 0:15:23]

«« CaptureDevice not working
»» problem in socket communication please help me!

# 1

So I guess if you read your assignment you saw this:

DO NOT COPY FROM OTHERS; DO NOT ALLOW ANYONE TO SEE YOUR CODE

The Penalty: You will be awarded a negative mark, -5, for this assignment if your submission is too similar to another submission. This penalty will apply whether you copied or were copied from. You will be notified by email. Plagiarism cases will be recorded on your file. Repeat offences will be more severely penalised, and may result in faculty-level disciplinary action.

DO NOT COPY FROM OTHERS; DO NOT ALLOW ANYONE TO SEE YOUR CODE

Ok. So what that says is we shouldn't post code here because you can't use it. And if you post code here, you run the risk of being copied by one of your peers. What exactly do you want us to do?

What part is giving you trouble?

mgbolusma at 2007-7-7 19:51:18 >

top of Java-index,Other Topics,Algorithms...

# 2

I don't see any point in following those links without a question from you that tells me what I should be looking for. You seem to have clicked on "Post" before you asked any question.

DrClapa at 2007-7-7 19:51:18 >

# 3

You would like me to have a look to see? Is there a question hiding in there somewhere? Perhaps you want someone to do your homework for you?Gal

GalBa at 2007-7-7 19:51:18 >

# 4

Do you think that it is easy homework?/

Do you have any idea how to do that?

Can you give me tips ? or may you can start do that?

I believe that it is a forum that should help others and not just say like all - "it is a homework - I can not do that", It is a kind of way to escape from trying to help more..

TheArtOfDarkness...

waelsalmana at 2007-7-7 19:51:18 >

# 5

If I were to write this I would first try to find the correct path and ignore the left right stuff. Think of all the posibile locations that your character can be (every space that isn't a wall) as nodes on the graph. Transitions from nodes are to the nodes of adjacent spaces. Then after you make the graph you can implement Dikjstra's algorithm on the graph. From there you can use the results (which will have the shortest path) and determine the left/right/forward sequence.

sethawa at 2007-7-7 19:51:18 >

# 6

I'm not saying you shouldn't ask questions, only that you should be explicit about what you need to know. Otherwise this will only be a waste of your time and ours.

As for the tip, my direction would be to create four vertices for each position in the maze: one for face up, one for face left, etc. Program the edges accordingly (every R, L and F move is translated to one edge, figure out how). Then finding the move list is reduced to finding a shortest path, and since the edges are unweighted even BFS would do.

Good luck.

Gal

GalBa at 2007-7-7 19:51:18 >

Java programming resources: FAQs, tutorials, compiler and browser download sites, documentation, books lists, IDEs, etc.

Urgent and I mportant - Path Planning and Maze Search - Dijkstra's Algorith

Other Topics New Topic

Other Topics Hot Topic

Other Topics

All Classified