How will you save Mike?
$begingroup$
You are Dr. Nathaniel - a renowned archaeologist, and involved in a research about an ancient site. But, there is only one problem - the place you are visiting to study about is cursed.
One of your colleagues Mike who happened to be on the same assignment has arrived a week earlier but is missing now. While searching for him, you find a huge stone entrance to an ancient temple near your assigned site, and along with that........
"What!?" You see Mike's stone statue.
"No wait. It is too life like to be a statue."
And you realise that it is indeed Mike who has been turned into stone.
You panic, and see a parchment with some numbers written on it. You can make out that it is surely Mike's handwriting, but the paper is somehow too damaged to understand what is written.
You move towards the statue, slowly, with chills running down your spine. Near the statue, on the entrance, there are four wheel type things engraved (Maybe, you aren't sure if they are engraved), and some blocks, 64 to be precise kept in a cavity in the wall. Each block contains a number, which can be 1, 2, 3, and 4, with 16 blocks of each number.
You hear some sound. Looking in its direction, you see a sandstorm, but it is just far enough that you can note down what is written on the wheels, and run back to your camp (because you think the camp would be a safer place for some reason). You quickly take out your note pad, jot down the written characters, and run for your safety, just reaching the camp before the sandstorm comes knocking at your door.
At the camp, you realise that the characters are nothing but the same numbers - 1, 2, 3, and wait, there wasn't any 4. You rewrite everything neatly on a new paper, marking a || for the blue glow at certain places on the perimeter of the wheels, and making | for a red glow. The result looks like this:
The last wheel was empty but had some slots- 16 in number. The numbers in the other three wheels seem to be like the blocks permanently fitted in identical slots.
You conclude that you need to figure out the pattern for the last wheel using the given three wheels. The blocks must be required to be fitted in the slots, with only one block per slot.
But how?
You need to hurry as the curse can be broken only within nine days. You don't know when Mike was turned into stone, but if it was on his first day here, then you have to be really fast.
How should the fourth wheel be filled with the blocks?
cipher pattern lateral-thinking story
edited 49 mins ago
Arnaud Mortier
1,372420
asked 2 hours ago
NatashaNatasha
48414
$endgroup$
add a comment |
$begingroup$
You are Dr. Nathaniel - a renowned archaeologist, and involved in a research about an ancient site. But, there is only one problem - the place you are visiting to study about is cursed.
One of your colleagues Mike who happened to be on the same assignment has arrived a week earlier but is missing now. While searching for him, you find a huge stone entrance to an ancient temple near your assigned site, and along with that........
"What!?" You see Mike's stone statue.
"No wait. It is too life like to be a statue."
And you realise that it is indeed Mike who has been turned into stone.
You panic, and see a parchment with some numbers written on it. You can make out that it is surely Mike's handwriting, but the paper is somehow too damaged to understand what is written.
You move towards the statue, slowly, with chills running down your spine. Near the statue, on the entrance, there are four wheel type things engraved (Maybe, you aren't sure if they are engraved), and some blocks, 64 to be precise kept in a cavity in the wall. Each block contains a number, which can be 1, 2, 3, and 4, with 16 blocks of each number.
You hear some sound. Looking in its direction, you see a sandstorm, but it is just far enough that you can note down what is written on the wheels, and run back to your camp (because you think the camp would be a safer place for some reason). You quickly take out your note pad, jot down the written characters, and run for your safety, just reaching the camp before the sandstorm comes knocking at your door.
At the camp, you realise that the characters are nothing but the same numbers - 1, 2, 3, and wait, there wasn't any 4. You rewrite everything neatly on a new paper, marking a || for the blue glow at certain places on the perimeter of the wheels, and making | for a red glow. The result looks like this:
The last wheel was empty but had some slots- 16 in number. The numbers in the other three wheels seem to be like the blocks permanently fitted in identical slots.
You conclude that you need to figure out the pattern for the last wheel using the given three wheels. The blocks must be required to be fitted in the slots, with only one block per slot.
But how?
You need to hurry as the curse can be broken only within nine days. You don't know when Mike was turned into stone, but if it was on his first day here, then you have to be really fast.
How should the fourth wheel be filled with the blocks?
cipher pattern lateral-thinking story
edited 49 mins ago
Arnaud Mortier
1,372420
asked 2 hours ago
NatashaNatasha
48414
$endgroup$
add a comment |
$begingroup$
You are Dr. Nathaniel - a renowned archaeologist, and involved in a research about an ancient site. But, there is only one problem - the place you are visiting to study about is cursed.
One of your colleagues Mike who happened to be on the same assignment has arrived a week earlier but is missing now. While searching for him, you find a huge stone entrance to an ancient temple near your assigned site, and along with that........
"What!?" You see Mike's stone statue.
"No wait. It is too life like to be a statue."
And you realise that it is indeed Mike who has been turned into stone.
You panic, and see a parchment with some numbers written on it. You can make out that it is surely Mike's handwriting, but the paper is somehow too damaged to understand what is written.
You move towards the statue, slowly, with chills running down your spine. Near the statue, on the entrance, there are four wheel type things engraved (Maybe, you aren't sure if they are engraved), and some blocks, 64 to be precise kept in a cavity in the wall. Each block contains a number, which can be 1, 2, 3, and 4, with 16 blocks of each number.
You hear some sound. Looking in its direction, you see a sandstorm, but it is just far enough that you can note down what is written on the wheels, and run back to your camp (because you think the camp would be a safer place for some reason). You quickly take out your note pad, jot down the written characters, and run for your safety, just reaching the camp before the sandstorm comes knocking at your door.
At the camp, you realise that the characters are nothing but the same numbers - 1, 2, 3, and wait, there wasn't any 4. You rewrite everything neatly on a new paper, marking a || for the blue glow at certain places on the perimeter of the wheels, and making | for a red glow. The result looks like this:
The last wheel was empty but had some slots- 16 in number. The numbers in the other three wheels seem to be like the blocks permanently fitted in identical slots.
You conclude that you need to figure out the pattern for the last wheel using the given three wheels. The blocks must be required to be fitted in the slots, with only one block per slot.
But how?
You need to hurry as the curse can be broken only within nine days. You don't know when Mike was turned into stone, but if it was on his first day here, then you have to be really fast.
How should the fourth wheel be filled with the blocks?
cipher pattern lateral-thinking story
edited 49 mins ago
Arnaud Mortier
1,372420
asked 2 hours ago
NatashaNatasha
48414
$endgroup$
You are Dr. Nathaniel - a renowned archaeologist, and involved in a research about an ancient site. But, there is only one problem - the place you are visiting to study about is cursed.
One of your colleagues Mike who happened to be on the same assignment has arrived a week earlier but is missing now. While searching for him, you find a huge stone entrance to an ancient temple near your assigned site, and along with that........
"What!?" You see Mike's stone statue.
"No wait. It is too life like to be a statue."
And you realise that it is indeed Mike who has been turned into stone.
You panic, and see a parchment with some numbers written on it. You can make out that it is surely Mike's handwriting, but the paper is somehow too damaged to understand what is written.
You move towards the statue, slowly, with chills running down your spine. Near the statue, on the entrance, there are four wheel type things engraved (Maybe, you aren't sure if they are engraved), and some blocks, 64 to be precise kept in a cavity in the wall. Each block contains a number, which can be 1, 2, 3, and 4, with 16 blocks of each number.
You hear some sound. Looking in its direction, you see a sandstorm, but it is just far enough that you can note down what is written on the wheels, and run back to your camp (because you think the camp would be a safer place for some reason). You quickly take out your note pad, jot down the written characters, and run for your safety, just reaching the camp before the sandstorm comes knocking at your door.
At the camp, you realise that the characters are nothing but the same numbers - 1, 2, 3, and wait, there wasn't any 4. You rewrite everything neatly on a new paper, marking a || for the blue glow at certain places on the perimeter of the wheels, and making | for a red glow. The result looks like this:
The last wheel was empty but had some slots- 16 in number. The numbers in the other three wheels seem to be like the blocks permanently fitted in identical slots.
You conclude that you need to figure out the pattern for the last wheel using the given three wheels. The blocks must be required to be fitted in the slots, with only one block per slot.
But how?
You need to hurry as the curse can be broken only within nine days. You don't know when Mike was turned into stone, but if it was on his first day here, then you have to be really fast.
How should the fourth wheel be filled with the blocks?
cipher pattern lateral-thinking story
cipher pattern lateral-thinking story
edited 49 mins ago
Arnaud Mortier
1,372420
asked 2 hours ago
NatashaNatasha
48414
edited 49 mins ago
Arnaud Mortier
1,372420
asked 2 hours ago
NatashaNatasha
48414
edited 49 mins ago
Arnaud Mortier
1,372420
edited 49 mins ago
Arnaud Mortier
1,372420
edited 49 mins ago
Arnaud Mortier
1,372420
1,372420
asked 2 hours ago
NatashaNatasha
48414
asked 2 hours ago
NatashaNatasha
48414
asked 2 hours ago
NatashaNatasha
48414
48414
add a comment |
add a comment |
0
active
oldest
votes
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: "559"
};
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%2fpuzzling.stackexchange.com%2fquestions%2f80730%2fhow-will-you-save-mike%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f80730%2fhow-will-you-save-mike%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
