tags: programming, challenge

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.

Stack, Expression Evaluation Challenge

Implement a stack. Use it to evaluate a simple mathematical expression. This expression will not have parentheses. It will use only plus, minus, multiply, and divide operators. The operands (input) will be integers, although output may be rational due to division. You may or may not use recursion. All code must be written by you.

Of course i'd like to see recursion. But if you think that's impossible then don't. When you see my example you will be proven wrong.

You swap out a stack for another data structure, but once again, don't wimp out.

Any code that is not used is seen wasteful and a bore to my eyes.