Dynamic Programming 动态规划 最优化理论与方法课件（英文版－南京大学）.pptVIP

Dynamic Programming动态规划 * Two Well-known Puzzles Example 1 Suppose there are 30 matches on a table. I begin by picking up 1, 2 or 3 matches. Then my opponent must pick up 1, 2 or 3 matches. We continue in this fashion until the last match is picked up. The player who picks up the last match is the loser. How can I (the first player) be sure of winning the game? Example 2 I have a 9-liter and a 4-liter cup. If I want to bring home exactly 6 liters of milk, how can I accomplish this? * A Network Problem Joe lives in Newyork city and plans to drive to Los Angeles. What is the shortest ro