Simple Traveling salesman in Maze (A*)

Question

1.00/5 (3 votes)

See more:

I need your help to solve the following problem urgently
the program belongs to my Artificial intelligence course
My problem is how to connect the maze to the problem:

this program shall use the console as output (NO GRAPHICS!)
The algorithms will perform in a maze that has to be created.
The maze shall be as large as the screen of the console in the end)
The maze shall be modified in that way, that about 50% off the walls shall be erased (to ease the complexity of the problem)

Simple traveling salesman.
10 agents have to act in a simple maze (missing 50% of the walls).
The agents start in arbitrary but uniformly distributed starting positions in the maze.
There are as many goals as agents, distributed uniformly in the maze.
The agents have to visit all the goals one by one.
The agents do know the location of the goals from the beginning.
The agents vanish from the maze if they've reached all goals.
The agents can visit the goals in an arbitrary order (this should be optimized too!) If a goal is occupied by another agent, the agent is allowed to change the goal. Agents cannot go through walls or other agents.
The agents shall use as less steps as possible.

Posted 7-Oct-12 5:44am

MSA6585

Updated 7-Oct-12 6:10am

Joan M

v2

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

enhzflep · Answer 1 · 2012-10-07T06:04:00

Okay, so you need to do two things at once - navigate within a maze and visit a list of arbitrary destinations.

So, use an function that works out the number of steps from one place in the maze to another.

Now, use the results of that function to assess the distance from your position to each of the destinations. After you've decided on the best destination to visit next, you trace the path used in the distance function to get to your destination. Repeat until all destinations have been visited.

Please, please, PLEASE - read this page: Tips to getting better answers in forums

OriginalGriff · Answer 2 · 2012-10-07T05:46:00

Solution 1

That is just your homework question, complete.

It doesn't work like that. You try to do it, you get stuck, you ask for help on your specific problem.

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is not as difficult as you think!

Posted 7-Oct-12 5:46am

OriginalGriff

Comments

MSA6585 7-Oct-12 11:56am

Yes I've said it my self that it's a homework.

I've not asked any one to do it for me.

I ask for guidance in relating maze and salesman problem

OriginalGriff 7-Oct-12 12:14pm

And what have you tried so far? What have you got so far?