Backward recurrent method is usually adopted in seeking optimal solution by dynamic programming. A forward recurrent method to find optimal solution by dynamic programming is presented on the basis of an instance. The fundamental equation of dynamic programming and Millton-Jacobi's equation are also derived. It's an exploratory study on optimal solution of dynamic programming. An amount of work is reduced in calculating by using forward recurrent method, while applied range of the method is expanded.