Re: S, B, and a puzzle by Boolos, Smullyan, McCarthy

`At 00:57 13/10/04 -0400, Jesse Mazer wrote:`

Nice work, Eric!

```Absolutely. I don't really need to add a thing, although
when I got the time I will compare Eric's solution with Boolos' one
(but I think they are quite the same).
It looks Eric solved what Boolos called "The Hardest Logical Puzzle Ever" ;-)```

`Bruno`

============
Your solution looks right to me. I now realize my mistake, I was thinking that if the gods are in a particular order (say, TRF) and Ja has a particular meaning (say, Ja=yes) and you get a particular series of answers (say, JJJ) then if you reverse the meaning of Ja and ask the same questions, that means you'll also get the reverse answers (in this case DDD). But if the question is of the form "If I asked X, would you say 'Ja'?" this isn't actually the case. The key seems to be that if you ask a question of the form "If I asked X, would you say 'Ja'?" then if X is true, both the knight and the knave will answer "Ja" regardless of whether Ja means "yes" or "no", and if X is false then both the knight and the knave will answer "Da" regardless of the meaning of Ja. So with that trick in mind, the solution to this problem will be exactly like the solution to the problem where the gods actually say "yes" and "no"...for example, I could take my previous solution to that problem:

`...and simply replace every "yes" with "Ja" and every "no" with "Da":`

`Jesse`
`http://iridia.ulb.ac.be/~marchal/`
```