Mr.X has five boxes arranged in a line (1-2-3-4-5). An intelligent rat comes out of nowhere and finds a place for itself in one of the boxes. Every night when Mr. X is sleeping, this rat moves to a new neighboring box to its left or to its right. Mr. X knew this behavior of the rat. Since this rat was a trouble for him, he was desperate to find it. Also due to paucity of time, he decided to search in only one of the boxes every day. He implements a strategy to make sure that he eventually finds this rat. This strategy helped him to find the rat in minimum number of trials in all cases possible. What is the minimum number of trials needed to come to the solution for all possible cases?
Question
Guest
Mr.X has five boxes arranged in a line (1-2-3-4-5). An intelligent rat comes out of nowhere and finds a place for itself in one of the boxes. Every night when Mr. X is sleeping, this rat moves to a new neighboring box to its left or to its right. Mr. X knew this behavior of the rat. Since this rat was a trouble for him, he was desperate to find it. Also due to paucity of time, he decided to search in only one of the boxes every day. He implements a strategy to make sure that he eventually finds this rat. This strategy helped him to find the rat in minimum number of trials in all cases possible. What is the minimum number of trials needed to come to the solution for all possible cases?
Link to comment
Share on other sites
25 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.