#include <PrioritizedUnit.h>
Inheritance diagram for PrioritizedUnit:
Public Member Functions | |
PrioritizedUnit (int x, int y, unit *target, Prioritized *alg) | |
The constructor. | |
virtual | ~PrioritizedUnit (void) |
Deleting the unit -- clean-up. | |
tDirection | makeMove (mapProvider *, reservationProvider *, simulationInfo *simInfo) |
The new makeMove only gives a map. | |
tDirection | makeMove (mapProvider *, reservationProvider *, simulationInfo *simInfo, PrioritizedGroup *g) |
The main procedure --- make move. | |
void | startNewTrial () |
Reset the unit for a new trial. | |
double | getAmountLearned () |
Returns the amount learned at all levels. | |
bool | done () |
The unit is done when the amount of learning on the trial is 0.0 and no tiles are explored by wA*. | |
char const * | getName () |
Returns the algorithm's name. | |
int | getNumAbsLevels () |
Returns the number of abstraction levels used by the algorithm. | |
void | logStats (statCollection *stats) |
Report Prioritized-specific stats. | |
Private Attributes | |
PrioritizedlevelData * | unitData |
Prioritized * | algorithm |
Friends | |
class | PrioritizedGroup |
|
The constructor.
|
|
Deleting the unit -- clean-up.
|
|
The unit is done when the amount of learning on the trial is 0.0 and no tiles are explored by wA*.
Reimplemented from searchUnit. |
|
Returns the amount learned at all levels.
|
|
Returns the algorithm's name.
Reimplemented from searchUnit. |
|
Returns the number of abstraction levels used by the algorithm.
|
|
Report Prioritized-specific stats.
Reimplemented from searchUnit. |
|
The main procedure --- make move.
|
|
The new makeMove only gives a map. The unit simulation won't calculate an mapAbstraction unless it has to. Thus, in simple pathfinding tests, the overhead is saved. Reimplemented from searchUnit. |
|
Reset the unit for a new trial.
|
|
|
|
Reimplemented from searchUnit. |
|
|