Re: [algogeeks] Re: Amazon Puzzle
Maybe those guys were having some gadgets like mobile phones or satellite phones.. So they would write their number on the other's paper... Or maybe they were carrying a GPS system.. So they would write a common (latitude,longitude) to meet at the same point... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon Puzzle
On Mon, Aug 8, 2011 at 1:58 PM, Puneet Goyal wrote: > I think if we use the relevance of the flight we would not be able to do > it, because we dont know when they jumped or where they jumped, > as far as i think, any one can just write an angle and the app. length of > the shadow( they may take the same as their heights) and i think that will > take them to the same point, i know it sounds a bit ridiculous :P > and the sunlight must be there > > > -- --- Puneet Goyal Student of B. Tech. III Year (Software Engineering) Delhi Technological University, Delhi --- -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon Puzzle
I think if we use the relevance of the flight we would not be able to do it, because we dont when they jumped or where they jumped, as far as i think, any one can just write an angle and the app. length of the shadow( they may take the same as their heights) and i think that will take them to the same height, i know it sounds a bit ridiculous :P and the sunlight must be there On Mon, Aug 8, 2011 at 1:34 PM, sumit gaur wrote: > Person jumping first faces in the direction of flight, person jumping > second faces in the direction opp. to the flight, and will just drop > down and they'll walk in the facing direction after jump. > > On Aug 7, 10:59 pm, Algo Lover wrote: > > Two people are travelling through flight. Both have parachute and jump > > anywhere randomly i.e none of them knows who has jumped where.(Assume > > there's a big desert and they jump at any random location). Now, both > > of them have a single piece of paper on which they can write > > instructions before jumping and that's the only way they can meet each > > other. What would they write on paper before jumping ? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- --- Puneet Goyal Student of B. Tech. III Year (Software Engineering) Delhi Technological University, Delhi --- -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Amazon Puzzle
Person jumping first faces in the direction of flight, person jumping second faces in the direction opp. to the flight, and will just drop down and they'll walk in the facing direction after jump. On Aug 7, 10:59 pm, Algo Lover wrote: > Two people are travelling through flight. Both have parachute and jump > anywhere randomly i.e none of them knows who has jumped where.(Assume > there's a big desert and they jump at any random location). Now, both > of them have a single piece of paper on which they can write > instructions before jumping and that's the only way they can meet each > other. What would they write on paper before jumping ? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon Puzzle
i feel, 1st person who jumps he just writes the time at he jumped. second person(my assumption) may be having the compass and watch to calculate the direction(of the 1st person) on his page/paper. Thank you, Siddharam On Mon, Aug 8, 2011 at 11:30 AM, Venkat wrote: > I ve a small assumption, if we consider flight go in straight > direction. > > Then in one paper, they can write " Walk towards flight direction" and > jump first. > > In another paper "Walk towards opposite to flight direction." > and jump jump at any random location in that stright line.. > then they can meet at middle point. > > Its may be a soultion, but not sure. > > Thanks > Venkat > http://cloud-computation.blogspot.com/ > > On Aug 7, 10:59 pm, Algo Lover wrote: > > Two people are travelling through flight. Both have parachute and jump > > anywhere randomly i.e none of them knows who has jumped where.(Assume > > there's a big desert and they jump at any random location). Now, both > > of them have a single piece of paper on which they can write > > instructions before jumping and that's the only way they can meet each > > other. What would they write on paper before jumping ? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Amazon Puzzle
I ve a small assumption, if we consider flight go in straight direction. Then in one paper, they can write " Walk towards flight direction" and jump first. In another paper "Walk towards opposite to flight direction." and jump jump at any random location in that stright line.. then they can meet at middle point. Its may be a soultion, but not sure. Thanks Venkat http://cloud-computation.blogspot.com/ On Aug 7, 10:59 pm, Algo Lover wrote: > Two people are travelling through flight. Both have parachute and jump > anywhere randomly i.e none of them knows who has jumped where.(Assume > there's a big desert and they jump at any random location). Now, both > of them have a single piece of paper on which they can write > instructions before jumping and that's the only way they can meet each > other. What would they write on paper before jumping ? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Amazon Puzzle
What is so ridiculous in this. My doubt it do we have to assume that the left and right directions of both the people are same or can we do without that also ? On Aug 7, 11:31 pm, shady wrote: > this is one ridiculous puzzle... this must have been asked to some > philosophy student by amazon... > > > > > > > > On Sun, Aug 7, 2011 at 11:29 PM, Algo Lover wrote: > > Two people are travelling through flight. Both have parachute and jump > > anywhere randomly i.e none of them knows who has jumped where.(Assume > > there's a big desert and they jump at any random location). Now, both > > of them have a single piece of paper on which they can write > > instructions before jumping and that's the only way they can meet each > > other. What would they write on paper before jumping ? > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon Puzzle
awesome :) On Wed, Jul 7, 2010 at 9:07 AM, Dave wrote: > There are 6 cases to consider (we can list them but we don't know > which one applies): > 1. Initially, all 4 coins are tails. > 2. Initially, all 4 coins are heads. > 3. Initially, 3 of the coins are heads, 1 is tails. > 4. Initially, 3 of the coins are tails, 1 is heads. > 5. Initially, 2 diagonal coins are heads, the others are tails. > 6. Initially, 2 adjacent coins are heads, the others are tails. > > After every flip, we ask if all coins are heads. > If so we have solved the puzzle, otherwise we continue to the next > step. > We proceed as follows: > 1. Flip all coins. > At this point, we have solved the puzzle if case 1 applies. > 2. Flip all coins. > At this point, we have solved the puzzle if case 2 applies. > 3. Flip any two diagonal coins. > 4. Flip all coins. > At this point, we have solved the puzzle if case 5 applies. > 5. Flip any two adjacent coins. > 6. Flip all coins. > 7. Flip any two diagonal coins. > 8. Flip all coins. > At this point, we have solved the puzzle if case 6 applies. > Thus, we are left with cases 3 and 4. > 9. Flip any one coin. > 10. Flip all coins. > At this point, if the one coin we flipped in step 9 was the odd one, > we have solved the puzzle. > Otherwise, the current configuration has 2 heads and 2 tails. > 11. Flip any two diagonal coins. > 12. Flip all coins. > At this point, we have solved the puzzle if the result of step 10 was > diagonal pairs. > 13. Flip any two adjacent coins. > 14. Flip all coins. > 15. Flip any two diagonal coins. > 16. Flip all coins. > At this point, we have solved the puzzle. > > Dave > > On Jul 5, 11:10 pm, Jitendra Kushwaha > wrote: > > Seems tough to do as every time we dont know which coins we flipped in > the > > previous move > > > > We can perform all the four operation one by one in circular fashion and > we > > will have probabilitty of getting all head up at some time. > > this is because even if table rotated at random, each of the for step > will > > do different thing from previous step. > > > > I have not proofed it rigorously. It seems to be a solution to me > > > > comments appreciated... > > > > -- > > regards > > Jitendra > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Amazon Puzzle
There are 6 cases to consider (we can list them but we don't know which one applies): 1. Initially, all 4 coins are tails. 2. Initially, all 4 coins are heads. 3. Initially, 3 of the coins are heads, 1 is tails. 4. Initially, 3 of the coins are tails, 1 is heads. 5. Initially, 2 diagonal coins are heads, the others are tails. 6. Initially, 2 adjacent coins are heads, the others are tails. After every flip, we ask if all coins are heads. If so we have solved the puzzle, otherwise we continue to the next step. We proceed as follows: 1. Flip all coins. At this point, we have solved the puzzle if case 1 applies. 2. Flip all coins. At this point, we have solved the puzzle if case 2 applies. 3. Flip any two diagonal coins. 4. Flip all coins. At this point, we have solved the puzzle if case 5 applies. 5. Flip any two adjacent coins. 6. Flip all coins. 7. Flip any two diagonal coins. 8. Flip all coins. At this point, we have solved the puzzle if case 6 applies. Thus, we are left with cases 3 and 4. 9. Flip any one coin. 10. Flip all coins. At this point, if the one coin we flipped in step 9 was the odd one, we have solved the puzzle. Otherwise, the current configuration has 2 heads and 2 tails. 11. Flip any two diagonal coins. 12. Flip all coins. At this point, we have solved the puzzle if the result of step 10 was diagonal pairs. 13. Flip any two adjacent coins. 14. Flip all coins. 15. Flip any two diagonal coins. 16. Flip all coins. At this point, we have solved the puzzle. Dave On Jul 5, 11:10 pm, Jitendra Kushwaha wrote: > Seems tough to do as every time we dont know which coins we flipped in the > previous move > > We can perform all the four operation one by one in circular fashion and we > will have probabilitty of getting all head up at some time. > this is because even if table rotated at random, each of the for step will > do different thing from previous step. > > I have not proofed it rigorously. It seems to be a solution to me > > comments appreciated... > > -- > regards > Jitendra -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
