Name: Zergling !wEl2xzTjdg 2010-11-02 0:06
Sup /prog/,
/v/ here, I'm a hobby programmer who's currently attempting to write a build order optimizer for SC2 [both for the fun of programming and so I can play SC2 better by having some sick build orders].
I'm having a bit of trouble trying to figure out what search algorithm I should be using to evaluate which build order is best in an efficient time. The major problem is that I have a large number of nodes [the state of the game each time I could make a decision, including 'wait'], each node has a large number of edges [each decision I could make] and the only real way to compare the build orders is at the end [the decision trees cannot be directly compared except when taken as a whole, rather than comparing nodes of n+1].
/v/ here, I'm a hobby programmer who's currently attempting to write a build order optimizer for SC2 [both for the fun of programming and so I can play SC2 better by having some sick build orders].
I'm having a bit of trouble trying to figure out what search algorithm I should be using to evaluate which build order is best in an efficient time. The major problem is that I have a large number of nodes [the state of the game each time I could make a decision, including 'wait'], each node has a large number of edges [each decision I could make] and the only real way to compare the build orders is at the end [the decision trees cannot be directly compared except when taken as a whole, rather than comparing nodes of n+1].