Jump to content
  • Advertisement
Sign in to follow this  
Nokturnal

Recursion In Flowchart

This topic is 4598 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I am trying to make a flowchart for the minimax algorithm , for those who havent run into it here is some pseudo code. The problem i am running into is depiction of a recursion. I have come across recursive functions but normally the call is towards the end of the function and the exit condition some where in between, the control is quite easy to show. But here , as the function (child) returns the value , a deal of processing is done in the parent function. I simply cant find a way to depict this relationship. The only other thing i could come up with was to show a instance of parent - child towards the end, i.e. show the value being returned. could some suggest solution for this ? Thanks!
function
   if condition met 
      evaluate & return value
   else
      generate moves
           traverse all moves (for loop)
                  current value = function(new_state)
                   compare with current best & choose the best one
            end for
   end if
return the best move found so far   

Free Image Hosting at www.ImageShack.us

Share this post


Link to post
Share on other sites
Advertisement
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!