BeeGee;

[color:"orange"]I disagree. Nothing in the original riddle stated that the monks had a death-wish[/color]

If a monk knows he has a red dot, he can either not jump and doom the entire world (including himself) to death, or he can jump, save the world and earn some bonus points from god.

[color:"orange"]As the riddle is stated, there is provably no algorithmic solution for any case where the number of dotted monks (X) is any value other than one (1).[/color]

Only if you assume a monk can wait an indefinite number of days before jumping if he knows he has a red dot. If you and another monk have a red dot, the only way to coordinate when to jump is to jump the day you are sure you have a red dot.

[color:"orange"]Thus, algorithmically, if the value of X is not equal to one (1), then the World would not end if and only if the monks GUESSED right[/color]

There is no need to guess. Count the number of dots you see and jump the day after that. All the monks with dots will see one less than those without, and will jump the day before (showing the rest of the monks they do not have a red dot and do not need to jump).


Kejero;

[color:"orange"]Nope. Given a situation, you ask whether something is true or not. "Suppose this is true, would that be true?". The first part is not a question, it's a hypothetical fact.[/color]

If conditional questions that can not be answered (thus providing information) with a yes or no do not count as questions, then that defeats the purpose limiting the number of question you can ask. Any such riddle is no longer a riddle, but a series of conditional question iterating over the possible solution until one question is answered.

Here is the solution with a single yes/no question (using your definition);

[*] If A and B tell the truth and C is a liar, is D a liar?
[*] If A and C tell the truth and B is a liar, is D a liar?
[*] If A and D....

[color:"orange"]You don't really want me to post the complex answer to be happy, do you?[/color]

Not if the complex answer also uses conditional question that do not count if the condition is not met.