Sign in to follow this  
Kimau

MinMax Leaf Nodes

Recommended Posts

When constructing a Min/Max or Alpha/beta gamtree what do you find is the best method of evolving the game state to the leaf node for evaluation without hogging memory or resources. Currently I'm using a method where the game can be broken down into a array (representing a matrix). The array is the manipulated statically by an order queue generated by the tree. Unfortantly this method is seperate from the game functions themselves and therefore isn't very good from a coding principle. What methodolgy would you recommend to get the game states for the leaf nodes so they can be evalutated??

Share this post


Link to post
Share on other sites
I am not entirely sure I understand your question. The minimax algorithm shouldn't require a whole lot of memory.

Post some pseudo-code of how you are organizing things and I'll see where your design can be improved.

Share this post


Link to post
Share on other sites
Basic breakdown.

Currently my AI code calculates what the next state SHOULD be then evaluates.

I f I change the game logic however then the AI is invalid. I want to generate snapshots of the game without affecting the game state. And without hogging memory or processor time.

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this