Search:

There's an array of structs, containing the different routes between each points. For example:
http://img693.imageshack.us/img693/9682/96931372.png

Now what my program should do is, when a user...

int y ( 1 );
int x = 2^discs;
for ( int i = 1 ; i < x ; i++ )
{
if ( i & 1 )
{
if ( y == 3 )
{
gold_discs--;
...

I'm sorry for ignoring your advice, I just don't know where to begin, so starting from my recursive code seems logical.

Ok, I would guess you would have to transfer first the smallest disc, and...

----

50 views and none is answering..

Hi, I made the recursive solution for the ToH problem, but I can't wrap my head around the iterative version.
I can't use vectors etc, just integer arrays or structs. Teacher gave me some clues...