Find the fewest turning path [closed] - path-finding
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
Tiles = {
{0,0,0,0,0,0,0,0,0,0},
{0,2,2,2,2,2,2,2,2,0},
{0,3,0,0,2,4,2,2,2,0},
{0,0,2,0,0,0,2,2,2,0},
{0,0,2,2,2,0,2,2,2,0},
{0,0,0,0,2,0,2,2,2,0},
{0,0,2,2,2,0,2,2,2,0},
{0,0,0,0,0,0,0,0,0,0}
}
0 is not clickable, other is clickable, otherways 0 is walkable an other is not, weh i click Tiles[3][2] (number 3) then Tiles[3][6] (number 4), i want to connect that 2 tile through walkable tile, the problem is i dont need a shortest solution, instead i need solution that have 2 or less corner (turning), i have spent 3 days to imagine and googling the algorithm, but no luck, can someone give me a clue or article about that, and i use lua but other language is still i appreciate.
Transform your grid into a graph using the following rules:
Every walkable tile in the grid corresponds to a node in the graph.
Two nodes are connected (with weight 1) in the graph if they are in the same row or column in the grid and every tile between them in the grid is walkable.
The shortest path in the graph corresponds to the path with fewest corners in the grid.
Related
Projection of points onto ellipsoid [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 9 years ago. I have a set of points (x0...xn, y0...yn, z0....zn) and an ellipsoid given by the equation: x^2/a^2 + y^2/b^2 + z^2/c^2 = 1. Is there an algorithm that could I use to project my points onto my ellipsoid? If so, what are the steps to accomplish this?
You also need a source point, the point that you are projecting from. Each point and the source point form a line, and you can find the intersection of that line and your ellipsoid. There will typically be either two or zero projection points, depending on whether the line intersects the ellipsoid or not. You might try solving the 2d case first to see if you understand it.
David Eberly's book on geometrical methods is usually a good source for such algorithms. You can get some insight from chapter 3 in this pdf. It is about point to ellipsoid distance evaluation but a lot of theory is the same.
Draw 7- dimentional space [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 10 years ago. I need to represent vectors in 7- dimensional space. How can I draw them and plot points on them?
I don't think there is a reasonable way to draw something 7-dimensional. Best thing to do is to draw several projections in fewer dimensions for instance 2 or 3. Even 4 dimensions is hard to comprehend for men.
What is most efficient way to plot a domain of convergence? [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 10 years ago. Say, you have a Newton Method algorithms with 2 parameters of interest(a,b). And I would like to plot their domain of convergence with x-axis = a, y-axis = b. Is there a really fast and simple to do this??? Any suggestions? My algorithm will basically converge for some values of a & b. If I input (a,b), it will return (the number of iterations , value of a that it converge to, value of b that it converge to). Right now, I am thinking of setting up a for loop within another for loop, which run through all possible values of b first holding a fixed, and all possible values that a will converge holding b fixed. However, my trouble is: how to identify whether a & b is converging or not. And is there a better way than using nested for loops????
Adding Legends to a radarchart [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 10 years ago. By following this thread I have created a radar chart. Can anyone suggest me how to add a legend to this graph?
Here's a generic legend to get you started. You can alter it to suit your particular needs:
legend(-2,0,
legend=c("V1","V2"),
pch=c(15,16),
col=c("blue","red"),
lty=c(1,2))
The first two arguments are the location of the legend, in terms of the plot's (x,y) coordinates. Check the help for more details on the various arguments to the legend function.
I think you're getting negative votes because you essentially asked others to do your work for you. In the future, try out a few things first to see if you can get at least a partial answer. Then, in your question, explain what you've tried and what, specifically, you're trying to accomplish.
algorithm to check whether a given graph is subgraph of another graph [closed]
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 11 years ago. i assume that we have 2 labeled graphs G and T and the algorithm determine if G a subgraph of T and the corresponding vertices in the main graphT and the subgraph G should have same label
That problem is called "subgraph isomorphism" and it is NP-complete (and so likely to be hard). Do you need a general solution for this, or just for a particular graph G? The second case is much easier. There is some general information about algorithms here. There is a version of one of the algorithms (actually, for a more general problem) in the Boost Graph Library (see documentation here).
A general answer for a general question: the problem you want to solve is known as 'subgraph isomorphism.' Have a look here for further references: http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem .