Cart (Loading....) | Create Account
Close category search window
 

A simple iterative algorithm for the towers of Hanoi problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chedid, F.B. ; Temple Univ., Tokyo ; Mogi, T.

The towers of Hanoi game is well known. The basic version, a favorite example for many authors, is often used in introductory textbooks on computer programming to demonstrate the elegance of writing recursive code. Here, a simple iterative optimal algorithm for the towers of Hanoi problem is presented

Published in:

Education, IEEE Transactions on  (Volume:39 ,  Issue: 2 )

Date of Publication:

May 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.