Am I allowed to use the XOR operation for the “Three Gods Puzzle” AKA the “Hardest Logic Puzzle”?












4














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







share|improve this question









New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Oh okay, sorry! I'll do that next time I ask.
    – homosexual-advocate
    yesterday










  • Oh okay, haha, sorry. I forgot I can edit questions. I'll do it right now.
    – homosexual-advocate
    yesterday
















4














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







share|improve this question









New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Oh okay, sorry! I'll do that next time I ask.
    – homosexual-advocate
    yesterday










  • Oh okay, haha, sorry. I forgot I can edit questions. I'll do it right now.
    – homosexual-advocate
    yesterday














4












4








4


0





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







share|improve this question









New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











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






share|improve this question









New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited yesterday







homosexual-advocate













New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked yesterday









homosexual-advocatehomosexual-advocate

263




263




New contributor




homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






homosexual-advocate is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • Oh okay, sorry! I'll do that next time I ask.
    – homosexual-advocate
    yesterday










  • Oh okay, haha, sorry. I forgot I can edit questions. I'll do it right now.
    – homosexual-advocate
    yesterday


















  • Oh okay, sorry! I'll do that next time I ask.
    – homosexual-advocate
    yesterday










  • Oh okay, haha, sorry. I forgot I can edit questions. I'll do it right now.
    – homosexual-advocate
    yesterday
















Oh okay, sorry! I'll do that next time I ask.
– homosexual-advocate
yesterday




Oh okay, sorry! I'll do that next time I ask.
– homosexual-advocate
yesterday












Oh okay, haha, sorry. I forgot I can edit questions. I'll do it right now.
– homosexual-advocate
yesterday




Oh okay, haha, sorry. I forgot I can edit questions. I'll do it right now.
– homosexual-advocate
yesterday










1 Answer
1






active

oldest

votes


















8














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.






share|improve this answer























  • 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?
    – homosexual-advocate
    yesterday






  • 3




    +1 for the xkcd :D
    – mathwhiz20
    yesterday










  • @homosexual-advocate you can solve it without either XOR or questions formatted like my example.
    – Excited Raichu
    yesterday










  • @ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
    – homosexual-advocate
    yesterday










  • @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.
    – mbomb007
    yesterday











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
});


}
});






homosexual-advocate is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















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









8














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.






share|improve this answer























  • 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?
    – homosexual-advocate
    yesterday






  • 3




    +1 for the xkcd :D
    – mathwhiz20
    yesterday










  • @homosexual-advocate you can solve it without either XOR or questions formatted like my example.
    – Excited Raichu
    yesterday










  • @ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
    – homosexual-advocate
    yesterday










  • @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.
    – mbomb007
    yesterday
















8














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.






share|improve this answer























  • 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?
    – homosexual-advocate
    yesterday






  • 3




    +1 for the xkcd :D
    – mathwhiz20
    yesterday










  • @homosexual-advocate you can solve it without either XOR or questions formatted like my example.
    – Excited Raichu
    yesterday










  • @ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
    – homosexual-advocate
    yesterday










  • @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.
    – mbomb007
    yesterday














8












8








8






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.






share|improve this answer














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.







share|improve this answer














share|improve this answer



share|improve this answer








edited yesterday

























answered yesterday









Excited RaichuExcited Raichu

6,11821065




6,11821065












  • 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?
    – homosexual-advocate
    yesterday






  • 3




    +1 for the xkcd :D
    – mathwhiz20
    yesterday










  • @homosexual-advocate you can solve it without either XOR or questions formatted like my example.
    – Excited Raichu
    yesterday










  • @ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
    – homosexual-advocate
    yesterday










  • @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.
    – mbomb007
    yesterday


















  • 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?
    – homosexual-advocate
    yesterday






  • 3




    +1 for the xkcd :D
    – mathwhiz20
    yesterday










  • @homosexual-advocate you can solve it without either XOR or questions formatted like my example.
    – Excited Raichu
    yesterday










  • @ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
    – homosexual-advocate
    yesterday










  • @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.
    – mbomb007
    yesterday
















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?
– homosexual-advocate
yesterday




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?
– homosexual-advocate
yesterday




3




3




+1 for the xkcd :D
– mathwhiz20
yesterday




+1 for the xkcd :D
– mathwhiz20
yesterday












@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
– Excited Raichu
yesterday




@homosexual-advocate you can solve it without either XOR or questions formatted like my example.
– Excited Raichu
yesterday












@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
– homosexual-advocate
yesterday




@ExcitedRaichu okay then, thank you! this puzzle is extremely hard lol.
– homosexual-advocate
yesterday












@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.
– mbomb007
yesterday




@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.
– mbomb007
yesterday










homosexual-advocate is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















homosexual-advocate is a new contributor. Be nice, and check out our Code of Conduct.













homosexual-advocate is a new contributor. Be nice, and check out our Code of Conduct.












homosexual-advocate is a new contributor. Be nice, and check out our Code of Conduct.
















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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.




draft saved


draft discarded














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





















































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







-

Popular posts from this blog

An IMO inspired problem

Image
14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
Read more

Management

Image
Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
Read more

Has there ever been an instance of an active nuclear power plant within or near a war zone?

Image
36 3 The question Has there ever been a military combat going on around an active (running or in outage but not decommissioned) commercial nuclear power plant? Or dangerously near it? If yes, how did the plant and its personnel fare in such situation? Why I ask Let's assume for the scope of this question modern commercial nuclear power plants (CANDU, PWR, BWR of generation II plus all of gen III and newer) are usually reasonably safe to operate given that the engineering has been done right and there is a whole cohort of very well trained personnel on-site at all times, well rested and with considerable resources on their hands. Things hard to get with an armed conflict like the recent Syrian war raging around. I can't seem to find any reference or a comprehensive article about this, hence this question.
Read more