Solving the pharaoh's golden staircase problem through dynamic programming

Authors:
Daniel E. Nohl
Affiliations:
Benedictine University, Lisle, IL
Venue:
Journal of Computing Sciences in Colleges
Year:
2004

Citing 6
Cited 0

Introduction to algorithms

Introduction to algorithms
Fundamentals of algorithmics

Fundamentals of algorithmics
Foundations of algorithms using C++ pseudocode (2nd ed.)

Foundations of algorithms using C++ pseudocode (2nd ed.)
Data Structures, Algorithms, and Applications in C++

Data Structures, Algorithms, and Applications in C++
Computer Algorithms: C++

Computer Algorithms: C++
Using puzzles in teaching algorithms

SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Pharaoh's Golden Staircase problem is an excellent example of a puzzle that is easily solved through dynamic programming. Puzzles that have dynamic programming solutions and are also interesting to students are very rare. This paper describes the problem, illustrates a solution, and analyzes the efficiency of that solution. This analysis uses discrete mathematics. Therefore, this puzzle not only is useful in the classroom as dynamic programming application but also provides the opportunity to apply mathematics from the course which is a standard in most computer science curricula.