TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

The Hardest Logic Puzzle Ever

55 点作者 zatkin大约 10 年前

10 条评论

justinpombrio大约 10 年前
Hardly the hardest. Here&#x27;s a harder:<p><a href="http:&#x2F;&#x2F;justinpombrio.net&#x2F;tell&#x2F;prisoner-lightbulb.html" rel="nofollow">http:&#x2F;&#x2F;justinpombrio.net&#x2F;tell&#x2F;prisoner-lightbulb.html</a><p>EDIT: Also, for anyone stuck on the three gods puzzle, the three sisters puzzle is a good stepping stone:<p><a href="http:&#x2F;&#x2F;mathpuzzlewiki.com&#x2F;index.php?title=Three_princesses" rel="nofollow">http:&#x2F;&#x2F;mathpuzzlewiki.com&#x2F;index.php?title=Three_princesses</a>
评论 #9403662 未加载
wmt大约 10 年前
<a href="http:&#x2F;&#x2F;www.smbc-comics.com&#x2F;?id=2886" rel="nofollow">http:&#x2F;&#x2F;www.smbc-comics.com&#x2F;?id=2886</a>
SEMW大约 10 年前
Another interesting one in the style of the Singaporean puzzle that&#x27;s been making the rounds recently: <a href="http:&#x2F;&#x2F;jdh.hamkins.org&#x2F;transfinite-epistemic-logic-puzzle-challenge&#x2F;" rel="nofollow">http:&#x2F;&#x2F;jdh.hamkins.org&#x2F;transfinite-epistemic-logic-puzzle-ch...</a> (knowledge of transfinite ordinals is useful)
im3w1l大约 10 年前
Hints: <a href="http:&#x2F;&#x2F;pastebin.com&#x2F;ypPA5Uab" rel="nofollow">http:&#x2F;&#x2F;pastebin.com&#x2F;ypPA5Uab</a>
nhumrich大约 10 年前
Do the true&#x2F; false gods know how the random god would answer? I don&#x27;t see how they could since only he know the randomness. But if they don&#x27;t know, they would have no way to answer the question, &quot;what would guy x say ja meant&quot; where x happens to be the random one.
评论 #9404920 未加载
评论 #9403874 未加载
SatvikBeri大约 10 年前
You can make this question even harder by removing foreknowledge of the words! So you know the gods have words for yes and no, but don&#x27;t know what those words are. Here&#x27;s an article on the solution: <a href="http:&#x2F;&#x2F;www.technologyreview.com&#x2F;view&#x2F;428189&#x2F;the-hardest-logic-puzzle-ever-made-even-harder&#x2F;" rel="nofollow">http:&#x2F;&#x2F;www.technologyreview.com&#x2F;view&#x2F;428189&#x2F;the-hardest-logi...</a>
评论 #9403958 未加载
jdiomede大约 10 年前
It seems like asking about randomness is not a valid question. I&#x27;m not sure how you would implement that (beyond checking for the assignment of random behavior), you can&#x27;t really find out until you observe a difference in behavior over a larger sampling.
评论 #9404926 未加载
NAFV_P大约 10 年前
Be very careful what you ask the gods, you might run into:<p><a href="http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Epimenides_paradox" rel="nofollow">http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Epimenides_paradox</a>
amelius大约 10 年前
You can ask multiple questions by compounding them into one. For example: &quot;what is the outcome of &#x27;is A true&#x27; converted to string and concatenated by the outcome of &#x27;is B true&#x27;&quot;?
评论 #9403141 未加载
Zecc大约 10 年前
&gt; each question must be put to exactly one god.<p>&gt; It could be that some god gets asked more than one question (and hence that some god is not asked any question at all).<p>Make up your mind.
评论 #9402998 未加载
评论 #9402957 未加载
评论 #9402960 未加载
评论 #9402959 未加载
评论 #9402968 未加载
评论 #9412823 未加载