The Crossing Puzzle and Dynamic Programming

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.

View article page

Download PDF