Unformatted text preview: erstanding the problem statement carefully
2. Working on simple examples
3. Working on related problems which are easier
4. Develop insight into the problem using steps 2 and 3
5. Solving the problem 17 An interesting example : Clever Prisoner problem
There are n prisoners in Jail.
Each prisoner is allocated ﬁxed place in a line right in the beginning. Each day the
following event happens. The warden of the jail is a tyrant.Each day the warden
asks all the prisoners to line in front him and mth (Here m>m) person is
executed. This continues till there is only one prisoner left. The last one remaining
is pardoned and set free....
View Full Document
This note was uploaded on 02/17/2014 for the course CS 101 taught by Professor Smitamazumdar during the Spring '12 term at IIT Kanpur.
- Spring '12