The Crossing Puzzle and Dynamic Programming
Jump To References Section
Authors
-
A. R. D. E., Kirkee, Poona-3. ,IN
Santosh Kumar
DOI:
https://doi.org/10.18311/jims/1964/16842Abstract
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.
Downloads
Download data is not yet available.
Metrics
Metrics Loading ...
Downloads
Published
1964-12-01
How to Cite
Kumar, S. (1964). The Crossing Puzzle and Dynamic Programming. The Journal of the Indian Mathematical Society, 28(3-4), 169–174. https://doi.org/10.18311/jims/1964/16842
Issue
Section
Articles
License
Copyright (c) 1964 Santosh Kumar
This work is licensed under a Creative Commons Attribution 4.0 International License.
7