This was highly entertaining. I hope to see more of this in the future.
EDIT: Never mind the stuff I said below. I figured it out.
This got me started on the Hardest Logic Puzzle. I seem to be making an error in reasoning, but I can’t identify the problem.
There are 12 possible ways to label A,B,C,da and ja. 3 yes-no questions can only distinguish between 8 states, so it must be possible to label A,B and C without knowing da and ja.
Random’s answer to any question is not correlated with the content of that question, so it seems impossible to extract any information from it. It is not possible to guarantee that random is not asked any questions, so that just leaves 2 useful questions. But there are 6 possible states. It seems like it should be impossible.
Assume the answer to the first question is da. From there, I would try to formulate a question so that the honest answer must also be da. If I get ‘da’, then B is either True or Random, otherwise, it is either False or Random. This reduces the problem to 4 states, which would be solvable if we knew which answer was yes and which was no. As it stands, I can only tell whether the answers to questions 1 and 3 are the same or different, so I am still left with 2 possibilities.
I assume this was discussed in the post you linked to, but I would rather not read through the comments there for fear that I will read someone else’s complete solution. Without completely giving it away, can someone please help clear up my confusion?
This was highly entertaining. I hope to see more of this in the future.
EDIT: Never mind the stuff I said below. I figured it out.
This got me started on the Hardest Logic Puzzle. I seem to be making an error in reasoning, but I can’t identify the problem.
There are 12 possible ways to label A,B,C,da and ja. 3 yes-no questions can only distinguish between 8 states, so it must be possible to label A,B and C without knowing da and ja.
Random’s answer to any question is not correlated with the content of that question, so it seems impossible to extract any information from it. It is not possible to guarantee that random is not asked any questions, so that just leaves 2 useful questions. But there are 6 possible states. It seems like it should be impossible.
Assume the answer to the first question is da. From there, I would try to formulate a question so that the honest answer must also be da. If I get ‘da’, then B is either True or Random, otherwise, it is either False or Random. This reduces the problem to 4 states, which would be solvable if we knew which answer was yes and which was no. As it stands, I can only tell whether the answers to questions 1 and 3 are the same or different, so I am still left with 2 possibilities.
I assume this was discussed in the post you linked to, but I would rather not read through the comments there for fear that I will read someone else’s complete solution. Without completely giving it away, can someone please help clear up my confusion?
ﾫﾗﾚﾛﾞﾕﾞﾚﾓﾚﾒﾚﾑﾋﾐﾙﾋﾗﾚﾏﾍﾐﾝﾓﾚﾒﾖﾌﾚﾎﾊﾖﾉﾞﾓﾚﾑﾋﾋﾐﾋﾗﾚﾋﾍﾊﾋﾗﾓﾖﾚﾚﾓﾚﾒﾚﾑﾋￒￒﾖﾙﾆﾐﾊﾔﾑﾐﾈﾗﾐﾈﾋﾐﾚﾇﾋﾍﾞﾜﾋﾋﾍﾊﾋﾗﾙﾍﾐﾒﾚﾖﾋﾗﾚﾍﾑﾐﾑￒﾍﾞﾑﾛﾐﾒﾘﾐﾛￓﾆﾐﾊﾔﾑﾐﾈﾗﾐﾈﾋﾐﾑﾐﾋﾜﾞﾍﾚﾈﾗﾚﾋﾗﾚﾍﾛﾞﾒﾚﾞﾑﾌﾆﾚﾌﾐﾍﾑﾐ
Thank you for replying. This showed up just as I was editing the parent.