Is the following problem a dynamic programming problem or some other type like stochastic optimization ?
You have 1000 boxes and only 1 box contains the "treasure". In order to find the correct box, you must line the boxes up 1-1000 and systematically remove one box, save the next box, remove the next box, etc, etc. What number box contains the treasure?