Sharpen Your Brain :)

Jeannotvb!!!
He wanna kill you!!!

take diamond sword
rip open bag
world is now my bag

You got the riddle wrong. There are supposes to be TWO people standing at the crossroads. One tells the truth, the other lies. It can’t be solved if there is only one person.

No
There’re two level of question.
Sure,yours is the one of them. But this is the harder one.
You can ask him in one question/one person.

Try it,dude. :wink:

Hmmm. I wouldn’t ask Jeannotvb anything. I would walk by him, giving him a high-five, and follow the path to the left. If where I end up is not village A, I turn around, high-five Jeannotvb again, and proceed to the other village.

I win

pretend there’s an explosive device on you that detonates if you pass by Jeannotvb twice

I’ll go walk around the back of the villages then.

pretend a minefield separates the two villages :3

Jetpack

Snicker.

Not thinking about the grammatical error but the dick-joke :awesome:

I have no idea what the fuck I’m reading…

Sometimes it’s better not to :slight_smile:

Haha; Whatever you wanna think… :stuck_out_tongue:

First time they, B villager, see you, they’ll bombard you like hot shit on road!!!
:fffuuu:

I have an idea.

Tell him to point to village A when the answer is “No” and to point to village B when the answer is “Yes”.

Then ask: “Are you lying today?”

Either way the answer is no, so he will point to village A.

that’s asking two questions though

Well, actually that is an order and a question.

Anyway, I think I got it. The question is

“Is the following affirmation true:
Either you are telling the truth today and village A is to the left
or you are telling lies today and village A is to the right
?”

If the answer is yes, village A is to the left. Otherwise, it is to the right.

It is a rather complicated question, but it is still only a question, and no pointing anywhere is necessary.

Another possibility:

"Is one and only one of the following alternatives true:

  • Village A is to the left
  • You are lying today
    ?"

Good job,guy!

But…
I think this one also works…
“If there is someone ask ‘Is that the way to the village A?’ what would you answer?”[/SIZE]

Case 1: He says a lie…
and the traveler point at the [COLOR=‘Lime’]right way, A.
So Jeannotvb will answer him : NO
Then he will answer you ‘Not no’ that is [COLOR=‘lime’]YES
[COLOR=‘Yellow’]Then you head to the village A.

Case 2: He says a lie…
and the traveler point at the [COLOR=‘red’]wrong way, B.
So Jeannotvb will answer him : Yes
Then he will answer you ‘Not yes’ that is [COLOR=‘Red’]NO
Thus you ain’t head to the village you just point.
[COLOR=‘yellow’]Then you head to the village A.

Case 3:He says the truth…
[COLOR=‘yellow’]Then you follow his word…

case closed

Is there anyone wanna share your puzzle?
Post it(or them) here, I wanna see yours!. :stuck_out_tongue:

What makes you think I’ll say anything in the first place? :slight_smile:

Your answer is simpler than mine :slight_smile:

This one is interesting:

There is a deck with any number of cards and with exactly N cards facing up. You are blindfolded, you can’t see a thing. Then Jeannotvb shuffles the deck without turning any card up or down and puts the deck in your hands. How is it possible for you to separate the deck in two parts in such a way that both parts have the same number of cards facing up?

You are allowed to turn the cards, count, separate any number of them, shuffle, anyway, you can do whatever you want except looking, so there is no
way to know what cards are facing up or down.

Obvious remark: no one will help you. Not even Jeannotvb :stuck_out_tongue:
No so obvious remark: the two parts do not need to have the same number of cards.

Founded in 2004, Leakfree.org became one of the first online communities dedicated to Valve’s Source engine development. It is more famously known for the formation of Black Mesa: Source under the 'Leakfree Modification Team' handle in September 2004.