An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used

スポンサーリンク

概要

• 論文の詳細を見る

• The Towers of Hanoi problem is a classical problem in puzzles, games, mathematics, data structures, and algorithms. In this letter, a least memory used algorithm is proposed by combining the source array and target array for comparing the sizes of disk and labeling the disks in the towers of Hanoi problem. As a result, the proposed algorithm reduces the space needed from 2n+2 to n+5, where n represents the disks number.

著者

• CHENG Fan-Chieh

  Department of Electronic Engineering, National Taiwan University of Science and Technology

• CHENG Fan-Chieh

  Department of Electronic and Computer Engineering, National Taiwan University of Science and Technology

• CHEN Yu-Kumg

  Department of Electronic Engineering, Huafan University

• FANG Chen-An

  Department of Electronic Engineering, Huafan University

関連論文

• An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used
• Foreground-Adaptive Motion Detection in Broad Surveillance Environments
• Image Quality Analysis of a Novel Histogram Equalization Method for Image Contrast Enhancement
• Hash-Based Linked-List Histogram Construction
• Energy-Efficient IDCT Design for DS-CDMA Watermarking Systems
• An Efficient O(1) Contrast Enhancement Algorithm Using Parallel Column Histograms

スポンサーリンク