Am I allowed to use the XOR operation for the “Three Gods Puzzle” AKA the “Hardest Logic Puzzle”?
$begingroup$
So I wanted to ask something about the Three Gods Puzzle which you can read more about from here: https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever
Basically, the question of the puzzle is: "Three gods 1, 2, and 3 are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of 1, 2, and 3 by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which."
I've been trying to solve this puzzle without the help of any hints or guides and recently I came up with a solution, but I'm not sure if this solution is allowed.
So basically, one of my questions use XOR to combine two statements. I even have a question that have 2 XORs to combine three statements (The first two are XOR'ed first, then whatever the result is XOR'ed to the third one). It's still a Yes/No question and the Gods can answer it with just X or Y (I'm using X and Y as the two possible answers of the Gods).
So yeah, am I allowed to combine two or more statements? If so, can I use the XOR logic gate to combine them? I don't think it breaks the rules since the rule just states it must be a Yes/No question, and mine IS a Yes/No question. It's Yes if exactly one of the two statements is True, and No otherwise. I still want some confirmation, however.
Thank you!
Oh and please no spoilers!
logical-deduction
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
$endgroup$
add a comment |
$begingroup$
So I wanted to ask something about the Three Gods Puzzle which you can read more about from here: https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever
Basically, the question of the puzzle is: "Three gods 1, 2, and 3 are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of 1, 2, and 3 by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which."
I've been trying to solve this puzzle without the help of any hints or guides and recently I came up with a solution, but I'm not sure if this solution is allowed.
So basically, one of my questions use XOR to combine two statements. I even have a question that have 2 XORs to combine three statements (The first two are XOR'ed first, then whatever the result is XOR'ed to the third one). It's still a Yes/No question and the Gods can answer it with just X or Y (I'm using X and Y as the two possible answers of the Gods).
So yeah, am I allowed to combine two or more statements? If so, can I use the XOR logic gate to combine them? I don't think it breaks the rules since the rule just states it must be a Yes/No question, and mine IS a Yes/No question. It's Yes if exactly one of the two statements is True, and No otherwise. I still want some confirmation, however.
Thank you!
Oh and please no spoilers!
logical-deduction
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
$endgroup$
add a comment |
$begingroup$
So I wanted to ask something about the Three Gods Puzzle which you can read more about from here: https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever
Basically, the question of the puzzle is: "Three gods 1, 2, and 3 are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of 1, 2, and 3 by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which."
I've been trying to solve this puzzle without the help of any hints or guides and recently I came up with a solution, but I'm not sure if this solution is allowed.
So basically, one of my questions use XOR to combine two statements. I even have a question that have 2 XORs to combine three statements (The first two are XOR'ed first, then whatever the result is XOR'ed to the third one). It's still a Yes/No question and the Gods can answer it with just X or Y (I'm using X and Y as the two possible answers of the Gods).
So yeah, am I allowed to combine two or more statements? If so, can I use the XOR logic gate to combine them? I don't think it breaks the rules since the rule just states it must be a Yes/No question, and mine IS a Yes/No question. It's Yes if exactly one of the two statements is True, and No otherwise. I still want some confirmation, however.
Thank you!
Oh and please no spoilers!
logical-deduction
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
$endgroup$
So I wanted to ask something about the Three Gods Puzzle which you can read more about from here: https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever
Basically, the question of the puzzle is: "Three gods 1, 2, and 3 are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of 1, 2, and 3 by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which."
I've been trying to solve this puzzle without the help of any hints or guides and recently I came up with a solution, but I'm not sure if this solution is allowed.
So basically, one of my questions use XOR to combine two statements. I even have a question that have 2 XORs to combine three statements (The first two are XOR'ed first, then whatever the result is XOR'ed to the third one). It's still a Yes/No question and the Gods can answer it with just X or Y (I'm using X and Y as the two possible answers of the Gods).
So yeah, am I allowed to combine two or more statements? If so, can I use the XOR logic gate to combine them? I don't think it breaks the rules since the rule just states it must be a Yes/No question, and mine IS a Yes/No question. It's Yes if exactly one of the two statements is True, and No otherwise. I still want some confirmation, however.
Thank you!
Oh and please no spoilers!
logical-deduction
logical-deduction
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
edited Jan 6 at 19:29
homosexual-advocate
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
asked Jan 6 at 12:02
homosexual-advocatehomosexual-advocate
263
263
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
TL; DR: Yes, however, there is a way to do it without them.
Any yes or no question is allowed; so all you have to do is word your question something like this:
Is exactly one of these statements true: you lie, you answer randomly?
(Obviously, that’s a terrible question to ask; it’s just an example.)
You can make questions as convoluted as you want; this isn’t the obligatory xkcd
I won’t spoil the solution without XOR, but good luck at finding it if you try.
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
$endgroup$
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
3
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
|
show 2 more comments
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%2f78171%2fam-i-allowed-to-use-the-xor-operation-for-the-three-gods-puzzle-aka-the-harde%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$
TL; DR: Yes, however, there is a way to do it without them.
Any yes or no question is allowed; so all you have to do is word your question something like this:
Is exactly one of these statements true: you lie, you answer randomly?
(Obviously, that’s a terrible question to ask; it’s just an example.)
You can make questions as convoluted as you want; this isn’t the obligatory xkcd
I won’t spoil the solution without XOR, but good luck at finding it if you try.
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
$endgroup$
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
3
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
|
show 2 more comments
$begingroup$
TL; DR: Yes, however, there is a way to do it without them.
Any yes or no question is allowed; so all you have to do is word your question something like this:
Is exactly one of these statements true: you lie, you answer randomly?
(Obviously, that’s a terrible question to ask; it’s just an example.)
You can make questions as convoluted as you want; this isn’t the obligatory xkcd
I won’t spoil the solution without XOR, but good luck at finding it if you try.
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
$endgroup$
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
3
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
|
show 2 more comments
$begingroup$
TL; DR: Yes, however, there is a way to do it without them.
Any yes or no question is allowed; so all you have to do is word your question something like this:
Is exactly one of these statements true: you lie, you answer randomly?
(Obviously, that’s a terrible question to ask; it’s just an example.)
You can make questions as convoluted as you want; this isn’t the obligatory xkcd
I won’t spoil the solution without XOR, but good luck at finding it if you try.
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
$endgroup$
TL; DR: Yes, however, there is a way to do it without them.
Any yes or no question is allowed; so all you have to do is word your question something like this:
Is exactly one of these statements true: you lie, you answer randomly?
(Obviously, that’s a terrible question to ask; it’s just an example.)
You can make questions as convoluted as you want; this isn’t the obligatory xkcd
I won’t spoil the solution without XOR, but good luck at finding it if you try.
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
edited Jan 6 at 12:20
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
answered Jan 6 at 12:14
Excited RaichuExcited Raichu
6,40021066
6,40021066
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
3
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
|
show 2 more comments
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
3
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
$begingroup$
Thank you! Also, are you saying that I can solve it without using XORs AND without phrasing my questions like your example? Or are you saying that I can just convert my XOR questions to something similar like your example?
$endgroup$
– homosexual-advocate
Jan 6 at 12:20
3
3
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
+1 for the xkcd :D
$endgroup$
– mathwhiz20
Jan 6 at 12:21
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
$endgroup$
– Excited Raichu
Jan 6 at 12:23
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
$endgroup$
– homosexual-advocate
Jan 6 at 12:25
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
$begingroup$
@homosexual-advocate If you know what XOR is, then you show know how the logic gate is defined. Use a truth table if you want to avoid using XOR. Write it in terms of the component logic gates instead.
$endgroup$
– mbomb007
Jan 6 at 17:47
|
show 2 more comments
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%2f78171%2fam-i-allowed-to-use-the-xor-operation-for-the-three-gods-puzzle-aka-the-harde%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
