KoenigsUnit Class Reference

#include <KoenigsUnit.h>

Inheritance diagram for KoenigsUnit:

[legend]Collaboration diagram for KoenigsUnit:

[legend]List of all members.

Public Member Functions
	KoenigsUnit (int x, int y, unit *target, Koenigs *alg)
	The constructor.
virtual	~KoenigsUnit (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, KoenigsGroup *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 Koenigs-specific stats.
Private Attributes
KoenigslevelData *	unitData
Koenigs *	algorithm
Friends
class	KoenigsGroup

---

Constructor & Destructor Documentation

KoenigsUnit::KoenigsUnit (  int  _x, int  _y, unit *  _target, Koenigs *  alg )

The constructor.

KoenigsUnit::~KoenigsUnit (  void   )  [virtual]

Deleting the unit -- clean-up.

---

Member Function Documentation

bool KoenigsUnit::done (   )  [virtual]

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.

double KoenigsUnit::getAmountLearned (   )

Returns the amount learned at all levels.

char const * KoenigsUnit::getName (   )  [virtual]

Returns the algorithm's name. Reimplemented from searchUnit.

int KoenigsUnit::getNumAbsLevels (   )

Returns the number of abstraction levels used by the algorithm.

void KoenigsUnit::logStats (  statCollection *  stats  )  [virtual]

Report Koenigs-specific stats. Reimplemented from searchUnit.

tDirection KoenigsUnit::makeMove (  mapProvider *  mp, reservationProvider *  rp, simulationInfo *  simInfo, KoenigsGroup *  group )

The main procedure --- make move.

tDirection KoenigsUnit::makeMove (  mapProvider *  , reservationProvider *  , simulationInfo *  simInfo )  [inline, virtual]

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.

void KoenigsUnit::startNewTrial (   )

Reset the unit for a new trial.

---

Friends And Related Function Documentation

friend class KoenigsGroup [friend]

---

Member Data Documentation

Koenigs* KoenigsUnit::algorithm [private]

Reimplemented from searchUnit.

KoenigslevelData* KoenigsUnit::unitData [private]

---

The documentation for this class was generated from the following files:

• /apps/RTS/KoenigsUnit.h
• /apps/RTS/KoenigsUnit.cpp

---