There are 6 holes in a wall. A mouse is in one hole I don\'t know which. A Cat comes by and looks in on hole. If he finds the mouse, game over. If not, the mouse Must move to an adjacent hole. (Cat doesn\'t see where). Cat looks again ... . What is the minimum number of times a cat has to look before he definitely gets the mouse. Solution We have 6 number of holes. and cat has to look in each for mouse. The worst case it should look are 5 times. As the number of holes are 6, in worst case by checking each hole if mouse n\'t catch it goes to adjacent hole. it moves to five holes in 5 attempts, in the next attempt it defineltly finds the mouse, as the only left over hole is reamain..

1. There are 6 holes in a wall. A mouse is in one hole I don't know which. A Cat comes by and
looks in on hole. If he finds the mouse, game over. If not, the mouse Must move to an adjacent
hole. (Cat doesn't see where). Cat looks again ... . What is the minimum number of times a cat
has to look before he definitely gets the mouse.
Solution
We have 6 number of holes. and cat has to look in each for mouse. The worst case it should look
are 5 times. As the number of holes are 6, in worst case by checking each hole if mouse n't catch
it goes to adjacent hole. it moves to five holes in 5 attempts, in the next attempt it defineltly finds
the mouse, as the only left over hole is reamain.