Cover: Dynamic programming and "difficult crossing" puzzles.

Dynamic programming and "difficult crossing" puzzles.

Published 1961

by Richard Ernest Bellman

Purchase Print Copy

 Format Price
Add to Cart Paperback7 pages $15.00

An application of dynamic programming theory to a familiar type of puzzle, classified in books on mathematical reactions as "difficult crossings." A typical problem is as follows: "A group consisting of three cannibals and three missionaries seeks to cross a river. A boat is available which will hold two people, and which can be navigated by any combination of cannibals and missionaries involving one or two people. If the missionaries on either side of the river, or in the boat, are outnumbered at any time by cannibals, the cannibals will indulge in their anthropophagic tendencies and do away with the missionaries. What schedule of crossings can be devised to permit the entire group of cannibals and missionaries to cross the river safely?" 7 pp.

This report is part of the RAND paper series. The paper was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.