What is the speed solution to Year 25 “My First Shredding Memory”?
I have the following solution to the puzzle, which solves the size challenge, but for time I need to shave off 7+ seconds (target = 132, my best = 139), and I don't understand how... 🤔
Basically, I think the problem is that the humans aren't getting out of the way at the end (when there's no more datacubes to pick up, so the other ones need to wait for them to shred themselves... And I can't see a way to move them out of the way or anything since I don't have the step command or things like that 😕
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
giveto mem1
jump a
Has anyone been able to solve this with average time below 132s?
7-billion-humans
add a comment |
I have the following solution to the puzzle, which solves the size challenge, but for time I need to shave off 7+ seconds (target = 132, my best = 139), and I don't understand how... 🤔
Basically, I think the problem is that the humans aren't getting out of the way at the end (when there's no more datacubes to pick up, so the other ones need to wait for them to shred themselves... And I can't see a way to move them out of the way or anything since I don't have the step command or things like that 😕
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
giveto mem1
jump a
Has anyone been able to solve this with average time below 132s?
7-billion-humans
1
Um, why the downvoting? 😟
– Svish
Sep 23 '18 at 17:14
add a comment |
I have the following solution to the puzzle, which solves the size challenge, but for time I need to shave off 7+ seconds (target = 132, my best = 139), and I don't understand how... 🤔
Basically, I think the problem is that the humans aren't getting out of the way at the end (when there's no more datacubes to pick up, so the other ones need to wait for them to shred themselves... And I can't see a way to move them out of the way or anything since I don't have the step command or things like that 😕
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
giveto mem1
jump a
Has anyone been able to solve this with average time below 132s?
7-billion-humans
I have the following solution to the puzzle, which solves the size challenge, but for time I need to shave off 7+ seconds (target = 132, my best = 139), and I don't understand how... 🤔
Basically, I think the problem is that the humans aren't getting out of the way at the end (when there's no more datacubes to pick up, so the other ones need to wait for them to shred themselves... And I can't see a way to move them out of the way or anything since I don't have the step command or things like that 😕
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
giveto mem1
jump a
Has anyone been able to solve this with average time below 132s?
7-billion-humans
7-billion-humans
asked Sep 23 '18 at 16:36
SvishSvish
1,08192543
1,08192543
1
Um, why the downvoting? 😟
– Svish
Sep 23 '18 at 17:14
add a comment |
1
Um, why the downvoting? 😟
– Svish
Sep 23 '18 at 17:14
1
1
Um, why the downvoting? 😟
– Svish
Sep 23 '18 at 17:14
Um, why the downvoting? 😟
– Svish
Sep 23 '18 at 17:14
add a comment |
2 Answers
2
active
oldest
votes
Apparently, when a program ends, they start moving out of the way, so just had to add an end somehow:
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
if myitem == datacube:
giveto mem1
else:
end
endif
jump a
add a comment |
You are right that the traffic in front of the shredder when there are no more cubes to pick up is the problem. The solution is that after you "pickup mem1", you should check to see if they actually picked something up. If they didn't, then you can "end" their program. In this way, they stop near the point of the failed pickup and not near the shredder and are thus out of the way.
pickup mem1
if [my item] == [nothing]
End
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "41"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2fgaming.stackexchange.com%2fquestions%2f338917%2fwhat-is-the-speed-solution-to-year-25-my-first-shredding-memory%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
Apparently, when a program ends, they start moving out of the way, so just had to add an end somehow:
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
if myitem == datacube:
giveto mem1
else:
end
endif
jump a
add a comment |
Apparently, when a program ends, they start moving out of the way, so just had to add an end somehow:
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
if myitem == datacube:
giveto mem1
else:
end
endif
jump a
add a comment |
Apparently, when a program ends, they start moving out of the way, so just had to add an end somehow:
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
if myitem == datacube:
giveto mem1
else:
end
endif
jump a
Apparently, when a program ends, they start moving out of the way, so just had to add an end somehow:
-- 7 Billion Humans (2145) --
-- 25: My First Shredding Memory --
mem1 = nearest shredder
a:
mem2 = nearest datacube
pickup mem2
if myitem == datacube:
giveto mem1
else:
end
endif
jump a
answered Sep 23 '18 at 18:20
SvishSvish
1,08192543
1,08192543
add a comment |
add a comment |
You are right that the traffic in front of the shredder when there are no more cubes to pick up is the problem. The solution is that after you "pickup mem1", you should check to see if they actually picked something up. If they didn't, then you can "end" their program. In this way, they stop near the point of the failed pickup and not near the shredder and are thus out of the way.
pickup mem1
if [my item] == [nothing]
End
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
You are right that the traffic in front of the shredder when there are no more cubes to pick up is the problem. The solution is that after you "pickup mem1", you should check to see if they actually picked something up. If they didn't, then you can "end" their program. In this way, they stop near the point of the failed pickup and not near the shredder and are thus out of the way.
pickup mem1
if [my item] == [nothing]
End
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
You are right that the traffic in front of the shredder when there are no more cubes to pick up is the problem. The solution is that after you "pickup mem1", you should check to see if they actually picked something up. If they didn't, then you can "end" their program. In this way, they stop near the point of the failed pickup and not near the shredder and are thus out of the way.
pickup mem1
if [my item] == [nothing]
End
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
You are right that the traffic in front of the shredder when there are no more cubes to pick up is the problem. The solution is that after you "pickup mem1", you should check to see if they actually picked something up. If they didn't, then you can "end" their program. In this way, they stop near the point of the failed pickup and not near the shredder and are thus out of the way.
pickup mem1
if [my item] == [nothing]
End
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 13 mins ago
Michael CromwellMichael Cromwell
1
1
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Michael Cromwell is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
Thanks for contributing an answer to Arqade!
- 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%2fgaming.stackexchange.com%2fquestions%2f338917%2fwhat-is-the-speed-solution-to-year-25-my-first-shredding-memory%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
1
Um, why the downvoting? 😟
– Svish
Sep 23 '18 at 17:14