Sven's Official BrainTeaser Thread !! and Sander.

[vish22]

Ok,I think i got it.Lets say that the giant:-
CASES:-
1. picks up a white gnome,and then a red one-the red one(who dosnt know that he is red)assumes his hat can be of any color and goes behind the white gnome.
Now,lets say a 3rd gnome is picked-
-he wouldnt know the color of his hat-so he decides to be on the safer side and get right into the middle of those two gnomes,which have 1 red and other white.In this way-the 4th gnome will get in between the gnomes where he sees that the colors of the hats are changing and so will the other incoming gnomes.

2.Picks up 2 gnomes such that they are of the same colour-then the 3rd gnome sees that the 2 are of the same colour and gets behind both of them,then the 4th one sees either-
-3 white(or 3red) gnomes-then the 4th gnome will occupy the place behind them
OR
-2 white(or red) and another red(or white) gnome-and so gets into the place,where there is a difference in color between 2 gnomes and so on and so forth...
Moral of story-get right in between 2 gnomes having different colored hats and if they all have same color,then go stand last,lol
Damn,this is hard to explain,but hope you'll get my point..Also hope that this is the right answer..

[sputnik]

okay the paint does not really work for me, but i shall explain clearer

room 1: 1000 gnomes are here with either a red or a white head (random) they do not know what they have themselves
the giant pickes randomly a gnome and let's it enter room 2
the gnomes may not talk, point, or make any other attempts for communication (anywhere)
room 2: the gnomes have to stand in line once they enter the room, when they have taken a spot in the line, they may not switch anymore
one half of the line should have all gnomes with the red hats and the other half the ones with the white hats (doesn't matter which side is red or white)

so the question is: explain how the gnomes have to solve this problem

the first gnome goes in (red). the second gnome goes in, sees other is red, stands next to it. third gnome goes in. if its (R)(R) then the knome stands anywhere. if its (R)(W) the gnome stands in between. then the next gnome stands in the middle, then the next in the middle, then the next. because they all stand at the divide, they all are in sequence. and when the next gnome comes in it can see the next divide, and do the same.

right?

[SeBaS]

wow  that was a good one +karma for sander :cheers:

[Max]

okay the paint does not really work for me, but i shall explain clearer

room 1: 1000 gnomes are here with either a red or a white head (random) they do not know what they have themselves
the giant pickes randomly a gnome and let's it enter room 2
the gnomes may not talk, point, or make any other attempts for communication (anywhere)
room 2: the gnomes have to stand in line once they enter the room, when they have taken a spot in the line, they may not switch anymore
one half of the line should have all gnomes with the red hats and the other half the ones with the white hats (doesn't matter which side is red or white)

so the question is: explain how the gnomes have to solve this problem

the first gnome goes in (red). the second gnome goes in, sees other is red, stands next to it. third gnome goes in. if its (R)(R) then the knome stands anywhere. if its (R)(W) the gnome stands in between. then the next gnome stands in the middle, then the next in the middle, then the next. because they all stand at the divide, they all are in sequence. and when the next gnome comes in it can see the next divide, and do the same.

right?

but the riddle says they cant change their positions. so if there are two gnomes standing next to each other no other gnome can walk between them.

[sputnik]

nothing says they cant be spaced apart or something.

[oLi]

nothing says they cant be spaced apart or something.

thats changing position

[Sander]

vish22 and sputnik are both right  :thumbsup: but vish22 was first so sorry sputnik. but i'm glad it's finally solved. i will be away from tomorrow untill friday, so it will be friday evening or saturday till i can post new ones

[sputnik]

finally :thumbsup: new riddle, someone

[Sander]

okay, just to keep you guys sharp. i hope it's not too hard and otherwise you should just wait till friday ;)

you are downstairs a house. there are three switches. all of them are connected to lamps A,B and C, which are all on the attic. how do know which one belongs to which switch? (you may look only once, then you should know it)

[SvenF]

okay, just to keep you guys sharp. i hope it's not too hard and otherwise you should just wait till friday ;)

you are downstairs a house. there are three switches. all of them are connected to lamps A,B and C, which are all on the attic. how do know which one belongs to which switch? (you may look only once, then you should know it)

pm me the answer.. if it takes too long because anyone knows it i will post it then because you're away until friday? :thumbsup:

[SeBaS]

okay, just to keep you guys sharp. i hope it's not too hard and otherwise you should just wait till friday ;)

you are downstairs a house. there are three switches. all of them are connected to lamps A,B and C, which are all on the attic. how do know which one belongs to which switch? (you may look only once, then you should know it)

shit i knew that one i cant remember the answeerrr :down: :down: :down: :down: :down:


edit: i remember now  :biggrin:

[SvenF]

okay, just to keep you guys sharp. i hope it's not too hard and otherwise you should just wait till friday ;)

you are downstairs a house. there are three switches. all of them are connected to lamps A,B and C, which are all on the attic. how do know which one belongs to which switch? (you may look only once, then you should know it)

what do you mean with "you may look only once, then you should know it"?
do you mean that you can turn on/off one switch?