Mixing
Given two positions, and a list of all positions, find quickest path
I have two points (x1, y1) & (x2, y2), and a list of all possible positions that can be traversed across with format (x, y), how would I find/estimate the quickest path between the two values.
I am implementing this in Java, but the language doesn't matter much.
Some limitations & additional info around the question:
- The values of
x1&x2will be never the same, unlessy1 = y2, this is because these positions are always located on the edge of a box. - There may not always be a path between
(x1, y1)&(x2, y2)(for when checking for continuity between the paths - Not all possible points will be connected to either
(x1, y1)or(x2, y2)
- Shortest path isn't required but would be handy to know
- Would be happy with simply some hints about what direction to take or algorithms to look into
- Travel can happen via a diagonal (
(x, y)&(x + 1, y + 1)are considered neighbours)
language-agnostic path-finding
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
add a comment |
I have two points (x1, y1) & (x2, y2), and a list of all possible positions that can be traversed across with format (x, y), how would I find/estimate the quickest path between the two values.
I am implementing this in Java, but the language doesn't matter much.
Some limitations & additional info around the question:
- The values of
x1&x2will be never the same, unlessy1 = y2, this is because these positions are always located on the edge of a box. - There may not always be a path between
(x1, y1)&(x2, y2)(for when checking for continuity between the paths - Not all possible points will be connected to either
(x1, y1)or(x2, y2)
- Shortest path isn't required but would be handy to know
- Would be happy with simply some hints about what direction to take or algorithms to look into
- Travel can happen via a diagonal (
(x, y)&(x + 1, y + 1)are considered neighbours)
language-agnostic path-finding
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
add a comment |
I have two points (x1, y1) & (x2, y2), and a list of all possible positions that can be traversed across with format (x, y), how would I find/estimate the quickest path between the two values.
I am implementing this in Java, but the language doesn't matter much.
Some limitations & additional info around the question:
- The values of
x1&x2will be never the same, unlessy1 = y2, this is because these positions are always located on the edge of a box. - There may not always be a path between
(x1, y1)&(x2, y2)(for when checking for continuity between the paths - Not all possible points will be connected to either
(x1, y1)or(x2, y2)
- Shortest path isn't required but would be handy to know
- Would be happy with simply some hints about what direction to take or algorithms to look into
- Travel can happen via a diagonal (
(x, y)&(x + 1, y + 1)are considered neighbours)
language-agnostic path-finding
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
I have two points (x1, y1) & (x2, y2), and a list of all possible positions that can be traversed across with format (x, y), how would I find/estimate the quickest path between the two values.
I am implementing this in Java, but the language doesn't matter much.
Some limitations & additional info around the question:
- The values of
x1&x2will be never the same, unlessy1 = y2, this is because these positions are always located on the edge of a box. - There may not always be a path between
(x1, y1)&(x2, y2)(for when checking for continuity between the paths - Not all possible points will be connected to either
(x1, y1)or(x2, y2)
- Shortest path isn't required but would be handy to know
- Would be happy with simply some hints about what direction to take or algorithms to look into
- Travel can happen via a diagonal (
(x, y)&(x + 1, y + 1)are considered neighbours)
language-agnostic path-finding
language-agnostic path-finding
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
edited Jan 1 at 21:23
FabianCook
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
asked Jan 1 at 21:16
FabianCookFabianCook
12.1k145198
12.1k145198
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
The answer I was looking for is to use A* as a search algorithm, this finds the shortest path between two points given a map of all the nodes.
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53999004%2fgiven-two-positions-and-a-list-of-all-positions-find-quickest-path%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
The answer I was looking for is to use A* as a search algorithm, this finds the shortest path between two points given a map of all the nodes.
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
add a comment |
The answer I was looking for is to use A* as a search algorithm, this finds the shortest path between two points given a map of all the nodes.
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
add a comment |
The answer I was looking for is to use A* as a search algorithm, this finds the shortest path between two points given a map of all the nodes.
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
The answer I was looking for is to use A* as a search algorithm, this finds the shortest path between two points given a map of all the nodes.
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
answered Jan 2 at 22:14
FabianCookFabianCook
12.1k145198
12.1k145198
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53999004%2fgiven-two-positions-and-a-list-of-all-positions-find-quickest-path%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
