Snake cube puzzle equation
$begingroup$
This is a Snake Cube Puzzle
I am trying to understand the solution from mathematical point of view. Someone even wrote a solver: https://github.com/markfickett/snakepuzzle but I can't really read the code. I can imagine a solver that would iterate through all combinations until it finds one that is 3x3x3 in size but that is not really a "solution".
What would be the equation and how would I approach solving it?
group-theory permutations puzzle
edited Jul 18 '18 at 17:01
0x90
6761818
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
$endgroup$
add a comment |
$begingroup$
This is a Snake Cube Puzzle
I am trying to understand the solution from mathematical point of view. Someone even wrote a solver: https://github.com/markfickett/snakepuzzle but I can't really read the code. I can imagine a solver that would iterate through all combinations until it finds one that is 3x3x3 in size but that is not really a "solution".
What would be the equation and how would I approach solving it?
group-theory permutations puzzle
edited Jul 18 '18 at 17:01
0x90
6761818
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
$endgroup$
$begingroup$
Follow this: youtube.com/watch?v=Ak-1b8OZG0g
$endgroup$
– user334732
Jul 18 '18 at 18:12
add a comment |
$begingroup$
This is a Snake Cube Puzzle
I am trying to understand the solution from mathematical point of view. Someone even wrote a solver: https://github.com/markfickett/snakepuzzle but I can't really read the code. I can imagine a solver that would iterate through all combinations until it finds one that is 3x3x3 in size but that is not really a "solution".
What would be the equation and how would I approach solving it?
group-theory permutations puzzle
edited Jul 18 '18 at 17:01
0x90
6761818
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
$endgroup$
This is a Snake Cube Puzzle
I am trying to understand the solution from mathematical point of view. Someone even wrote a solver: https://github.com/markfickett/snakepuzzle but I can't really read the code. I can imagine a solver that would iterate through all combinations until it finds one that is 3x3x3 in size but that is not really a "solution".
What would be the equation and how would I approach solving it?
group-theory permutations puzzle
group-theory permutations puzzle
edited Jul 18 '18 at 17:01
0x90
6761818
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
edited Jul 18 '18 at 17:01
0x90
6761818
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
edited Jul 18 '18 at 17:01
0x90
6761818
edited Jul 18 '18 at 17:01
0x90
6761818
edited Jul 18 '18 at 17:01
0x90
6761818
6761818
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
asked May 15 '14 at 9:23
daniel.sedlacekdaniel.sedlacek
18612
18612
$begingroup$
Follow this: youtube.com/watch?v=Ak-1b8OZG0g
$endgroup$
– user334732
Jul 18 '18 at 18:12
add a comment |
$begingroup$
Follow this: youtube.com/watch?v=Ak-1b8OZG0g
$endgroup$
– user334732
Jul 18 '18 at 18:12
$begingroup$
Follow this: youtube.com/watch?v=Ak-1b8OZG0g
$endgroup$
– user334732
Jul 18 '18 at 18:12
$begingroup$
Follow this: youtube.com/watch?v=Ak-1b8OZG0g
$endgroup$
– user334732
Jul 18 '18 at 18:12
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
One can certainly write a solver that just tries all the possibilities, as long as you do it step by step and throw away the ones that fail. The cube target is quite restrictive. If your first three steps are forward it is already too big so you ignore that. The more steps you take, the more likely the shape won’t fit. The number of possibilities stays reasonable. There is a whole literature on tree searching.
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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
},
noCode: 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%2fmath.stackexchange.com%2fquestions%2f795694%2fsnake-cube-puzzle-equation%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
$begingroup$
One can certainly write a solver that just tries all the possibilities, as long as you do it step by step and throw away the ones that fail. The cube target is quite restrictive. If your first three steps are forward it is already too big so you ignore that. The more steps you take, the more likely the shape won’t fit. The number of possibilities stays reasonable. There is a whole literature on tree searching.
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
$endgroup$
add a comment |
$begingroup$
One can certainly write a solver that just tries all the possibilities, as long as you do it step by step and throw away the ones that fail. The cube target is quite restrictive. If your first three steps are forward it is already too big so you ignore that. The more steps you take, the more likely the shape won’t fit. The number of possibilities stays reasonable. There is a whole literature on tree searching.
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
$endgroup$
add a comment |
$begingroup$
One can certainly write a solver that just tries all the possibilities, as long as you do it step by step and throw away the ones that fail. The cube target is quite restrictive. If your first three steps are forward it is already too big so you ignore that. The more steps you take, the more likely the shape won’t fit. The number of possibilities stays reasonable. There is a whole literature on tree searching.
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
$endgroup$
One can certainly write a solver that just tries all the possibilities, as long as you do it step by step and throw away the ones that fail. The cube target is quite restrictive. If your first three steps are forward it is already too big so you ignore that. The more steps you take, the more likely the shape won’t fit. The number of possibilities stays reasonable. There is a whole literature on tree searching.
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
answered Jul 19 '18 at 21:56
Ross MillikanRoss Millikan
299k24200374
299k24200374
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f795694%2fsnake-cube-puzzle-equation%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
$begingroup$
Follow this: youtube.com/watch?v=Ak-1b8OZG0g
$endgroup$
– user334732
Jul 18 '18 at 18:12