Question

Can anyone help me with this strategy problem?

Answer 1

I am a powerful strategist

Answer 2

:D

Answer 3

Oh no it's one of these.

Answer 4

Yes, i hate those too

Answer 5

I haven't done one since 5th grade -_-

Answer 6

Can you help me though?

Answer 7

Do you know of the three headed dragon problem?

Answer 8

It seems rather like that, except you don't have to ask the questions....

Answer 9

Nope, never heard of it

Answer 10

Ohh wait nm i did hear of it

Answer 11

When i was a child lol

Answer 12

http://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever

Answer 13

But this is easier. You can do it this way: There are only 6 possible ways that the children can be. Assume each of them and then check for contradiction.

Answer 14

I have no idea how to do that

Answer 15

Their names are Jeremy, Arturo, and Mark. I'll call that J, A, and M. In order of increasing age, the children are thus JAM, JMA, MAJ, MJA, AJM, or AMJ. Assume each and read the information of the problem. It looks like the problem is so designed that 5 of these will produce a contradiction, and one will not.

Answer 16

Im confused

Answer 17

They all freakin say that they are the middle child

Answer 18

Ok, so let us assume that it is JAM. Then the oldest child says that the middle child is Jeremy, and that is a lie, since we assumed he was mark (who always lies). Arturo says something but forget him he's useless. Then the youngest says something: the middle child is mark. But since we assumed that the youngest is Jeremy who never lies, and also that the middle child is arturo, this is a contradiction.

Answer 19

Of course, you could possibly do this more efficiently, but this case is so small that you don't have to prune at all and can just examine all possibilities.

Answer 20

Is it JAM and MJA and AMJ dont work

Answer 21

JMA too

Answer 22

So its AJM right?