|
There are four friends on an amazing maze( <a href="http://postimg.org/image/ci1kbz1xp">View image: blind maze</a> ), including some walls/deadlocks. These walls, however, are not recognized until getting them. Design an efficient algorithm which these people can approach each others in one place.
|
|
|
|
|
No repost
Use Improve question to complete original question in QA or Edit in forum.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
modified 29-Feb-16 15:38pm.
|
|
|
|
|
There are four friends on an amazing maze
( <a href="http://postimg.org/image/ci1kbz1xp">View image: blind maze</a> )
, including some walls/deadlocks. These walls, however, are not recognized until getting them. Design an efficient algorithm which these people can approach each others in one place.
|
|
|
|
|
Your homework should serve the purpose that you learn something. And that something isn't supposed to be how to get other people to doing your homework for you.
Your assignments will get more difficult over time - so if you don't start doing them yourself now you'll never be able to.
So sit down, think about it and try something. If you then encounter a specific problem, feel free to ask - that's the idea of these forums.
If the brain were so simple we could understand it, we would be so simple we couldn't. — Lyall Watson
|
|
|
|
|
Sascha: I thought about that. But could not find an efficient way: A general solution is one person is fix and the persons moving toward him/her. But I don't like this idea 
|
|
|
|
|
There are other things you could declare as fixed 
If the brain were so simple we could understand it, we would be so simple we couldn't. — Lyall Watson
|
|
|
|
|
BTW, in order to design an efficient algorithm it's neccessary to know if the information of their current coordinates and/or the size of the maze is known to the person/algorithm. If this isn't stated in your assignment you should either ask your teacher or define this yourself and then document it in your solution description.
If the brain were so simple we could understand it, we would be so simple we couldn't. — Lyall Watson
|
|
|
|
|
amirsharifzadeh wrote: Sascha: I thought about that. But could not find an efficient way
Start by finding something that work, no matter if efficient or not.
When you have a working solution, think about how to improve it.
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
The problem definition is not complete.
View image: blind maze[^]
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
I'm new here and not sure where to post thisI need a code so that someone could copy a link from a website and paste and save into a pop up box from a software program for later viewing. The link will be embedded into an image and they just click on it to get them to the site. Any ideas?
|
|
|
|
|
You've described some requirements ... steps ... that could be performed manually or partially by an existing program ... And an "link" is distinct from a "image" (not "embedded").
My idea is that you need to express in more concrete terms what the "code" should actually "do" and how a "user" (not a bot) interacts with the process.
|
|
|
|
|
The code already exists in most applications, and is commonly executed by the Ctrl+C - Ctrl+V sequence. The first thing you need to decide is what this program of yours is supposed to do: copy, copy and paste, or just paste. Also what language do you plan to write it in?
|
|
|
|
|
I should prepare an Algorithm Exam but some of the Questions sound strange to me... if someone can help me it can be really great...
-It's possible to order an HEAP in time o(n log(n))?
-It's possible to create an HEAP in time o(n log(n))?
-It's possible to order a BST in time o(n log(n))?
-It's possible to create a BST in time o(n log(n))?
Thank you from now and sorry for my bad english
modified 9-Feb-16 11:13am.
|
|
|
|
|
|
Hi,
Given a set of points data, does any one know how to formulate Bezier Spline surface.
Thanks in advance.
SSETH
|
|
|
|
|
Please post questions once only.
|
|
|
|
|
My earlier question is completely different than this one..
Thanks.
|
|
|
|
|
It may be slightly different, but in essence it is the same issue.
|
|
|
|
|
No Richard..The earlier question was for "curve"... And this one is for "surface". which is pretty complex than Curve.
|
|
|
|
|
|
Not really, a surface is composed of two curves, so it is the same question. If you don't understand curves, you won't understand surfaces. Simple as that.
|
|
|
|
|
Can any one suggest how to create C2 continuous piece wise Bezier spline curve with vector method?
Thanks in advance.
~SSETH
|
|
|
|
|
What do you mean by create?
|
|
|
|
|
|
Does it make any sense to test decision tree on dataset generated randomly? example: (the output "true"/"false" is not conditioned on parameters 1-10)
for (int i = 0; i < l; i++)
{
string[] new_ex = new string[11];
new_ex[0] = ThreadSafeRandom.ThisThreadsRandom.Next(60)%5 == 1 ? "true" : "false";
for (int r = 1; r < 5; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(60)%3).ToString();
for (int r = 5; r < 7; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(60)%3).ToString();
for (int r = 7; r < 9; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(20)%5).ToString();
for (int r = 9; r < 11; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(4)).ToString();
dataset.Add(new_ex);
}
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
