Observations on Multi-Peg Towers of Hanoi,

Abstract

A generalization of the classic Towers of Hanoi problem permitting additional work pegs is considered. While the idea is not original, this form of generalization has not appeared in published literature to my knowledge. Several upper bounds and lower bounds are presented for various ranges of extra work pegs, improving on the work of Gacs. A general methodology of attack is also given, producing exact results in many cases.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1986
Accession Number
ADA183328

Entities

People

  • Richard Newman-wolfe

Organizations

  • University of Rochester

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Computers
  • Identities
  • Inequalities
  • Information Processing
  • Literature
  • Mathematics
  • Observation
  • Polynomials
  • Procedures (Computers)
  • Recreation
  • Sequences
  • Standards
  • Universities

Readers

  • Approximation Theory.
  • Nanocomposite Materials Science
  • Systems Analysis and Design