A Recursive Algorithm for the Bottleneck Reve's Puzzle
A. A. K. Majumdar, Amiya Halder · Institutional Repositories DataBase (IRDB) · 1996
This paper gives the dynamic programming formulation of the bottleneck Reve's puzzle, in which the movements of the discs are restricted by the bottleneck size, $b$ , where $b(\geq 1)$ is a preassigned integer.We have derived some local-value relationships, and based on these, we have given an algorithm that enables us to determine the optimal value function as well as the related parameters without appealing to the dynamic programming equations.