The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

The Crossing Puzzle and Dynamic Programming


Affiliations
1 A. R. D. E., Kirkee, Poona-3., India
     

   Subscribe/Renew Journal


A familiar type of puzzle, classified in the books on mathematical recreations as "difficult crossing" has been generalised and solved by the application of Dynamic Programming by R. Bellman [1]. The object of this paper is to point out that the theory of Dynamic Programming can solve a still more general form of the problem.
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 278

PDF Views: 0




  • The Crossing Puzzle and Dynamic Programming

Abstract Views: 278  |  PDF Views: 0

Authors

Santosh Kumar
A. R. D. E., Kirkee, Poona-3., India

Abstract


A familiar type of puzzle, classified in the books on mathematical recreations as "difficult crossing" has been generalised and solved by the application of Dynamic Programming by R. Bellman [1]. The object of this paper is to point out that the theory of Dynamic Programming can solve a still more general form of the problem.