article

Action executed in 0.000

Challenge: Towers of Hanoi

Here's a new software challenge for us all. Take my project Towers of Hanoi and make it work. The goal is to write a recursive function to solve the game. Please print the towers after each iteration. The skeleton is already written. Just implement towers::execute().

A makefile is included. You may create new files, though i'm not sure that's necessary.

Please put your comments about the challenge under this "article" or email me directly.

Comments

Emacs

tags:

As suggested by Moss, emacs, meta-x hanoi is not a valid solution, but it's pretty impressive. Does anyone know how to make it do more than 3 coins?

parent post: Challenge: Towers of Hanoi
notify me: yes

Post a Comment

* indicates a required field
anonymous (If you want to identify yourself, please sign in first.)
required This field is required.

Max size is 2 MB, aspect ratio 3:4 width:height
required This field is required.
Please include a short description.
required This field is required.

480 characters remaining.
is public

(Use this field if you have to. 3000 characters remaining.)
2 pennies, 1 nickel + 100

Trackback URL

http://derocher.org/~brian//trackback.php?ParentId=1977

form