Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

JavaScript

Darryl Driedger
seal-mask
.a{fill-rule:evenodd;}techdegree
Darryl Driedger
Full Stack JavaScript Techdegree Student 24,724 Points
Posted by Darryl Driedger
.a{fill-rule:evenodd;}techdegree
Darryl Driedger
Full Stack JavaScript Techdegree Student 24,724 Points

JavaScript minimax

I am having a bit of trouble visualizing the minimax algorithm.

I understand the concept of recursively iterating through the tree of possibilities. My questions are:

  • When I push the leaf node results into an array or object or combination: -Do I push all of the results and reference each subset to one of the nine base branches? -Do I separate all of the results into a large object that reference the base nodes? -Do I push the results into an array with subsets of arrays within the base array?

Does my dilemma make sense or am I missing something? I may not have explained my issue very clearly, so any input would be appreciated.