CDynamicProgrammingStrategy::CDynamicProgrammingStrategy(const Map &_map, const PlayerState &_initialState) : map(_map) , initialState(_initialState) , minPath( _map.sizeOnXaxis(), _map.sizeOnYaxis(), UNREACHABLE ) { minPath.SetStepCount(initialState, 0); stateQueue.push(initialState); calculatePaths(); findOptimalPath(); }
bool calculatePathsNode1() { return calculatePaths(&dt1, &ln1, &rt1, &nb1, 1); }
bool calculatePathsNode0() { return calculatePaths(&dt0, &ln0, &rt0, &nb0, 0); }