TESTfunda Puzzle of the Week 25-May-12

	If you're having trouble viewing this email, see the Puzzle of the Week on the Web.

	25-May-12 TestFunda Home | Sign up for Newsletters | Feedback Puzzle of Week Puzzle # 210 - Astra'a Astronomical Expedition II 24-May-12 Astra successfully solved the magic square and so king Dark Matter of Sorcera had to release her and give her the codes which would reverse the time travel and help her return to the dimension to which she belonged. But Dark Matter had his own twisted schemes which made him give Astra incorrect codes due to which she passed through the black hole and reached an altogether new dimension and landed on a planet named Draconia. She was captured by King Megamath of Draconia and was imprisoned. There, she met 14 other inmates who were also explorers and were stuck in the cell. King Megamath also has a penchant for puzzles. Seeing Astra’s desperation to be free again, he offers Astra a deal. He has two boulder crushing machines, each one of which is either currently switched off or switched on. Only Megamath knows which machine(s) is/are on and which machine(s) is/are off. One of the prisoners will be randomly called and ordered to toggle the switch position of exactly one of the two machines i.e. the prisoner can either switch off exactly one machine which is already on or it can switch on exactly one machine that is off but a prisoner will not be allowed to reinstate the position of the switch to what it was in the beginning. No order will be followed when it comes to calling the prisoners and any one may be ordered to come to toggle switch positions any day for any number of times. This process may or may not take place everyday and depends totally on Megamath’s mood. None of the prisoners know who or when someone has been asked to toggle switches. A time will come when all the prisoners will get their respective turns to toggle switches. If Astra is successfully able to declare when all the prisoners have got their turns, they all will be released. However, if even a single prisoner is yet to get his/her turn and Astra declares that all of them have toggled at least once, then all the prisoners will be crushed using the boulder crushing machines. The prisoners cannot communicate amongst themselves once the king starts ordering the prisoners to go and toggle switches. If any one is caught communicating with the others, then all of them will be crushed. Help Astra to devise a strategy to counter the evil lord’s cunning plans. Give a detailed solution for the same. discuss | more puzzles   Do you have solution! If you think you know the solution submit your solution (do not reply to this email, use the link). The first person to send a 100%-correct solution and five other people, picked at random from all the 100%-correct solutions submitted by Sunday, will get 200 Reward Points. TestFunda team's decision on the correctness of the solution will be final. If you have ideas on how to solve it, or would like to discuss it with other users, we recommend that you put your thoughts in the comments section. TestFunda.com - LEARN with THE LEADER in Online MBA Test Prep Demo Lessons   |   Take a Free Test   |   Buy Courses   |   Fun Learning Games   |   100-Percentilers About TestFunda.com - TestFunda is backed by www.ZeusLearning.com. 4 IIT-IIM graduates form the Management Team. - The 85+ member team has vast experience in MBA Coaching and Computer-Based Training and Testing. - For 9 years Zeus has created award-winning courseware for companies like Discovery Channel, Reader's Digest, Texas Instruments, Pearson Education. - The TestFunda Advisory Board comprises CEOs and MDs of international educational companies. About This Newsletter You received this email because you have registered with www.TestFunda.com. If you do not want to receive this email or want to sign up for other newsletters from TestFunda  click here. Problems getting this mail? To get this mail in your inbox, add noreply@testfunda.com to your contact list.       UNSUBSCRIBE / SUBSCRIBE | ABOUT | WHY TESTFUNDA | FAQ | PRIVACY | SUPPORT | CONTACT | DISCUSS   © Enabilon Learning Private Limited. All rights reserved