SGStep Class Reference

A single step of the max-min-max algorithm. More...

#include <sgstep.hpp>

Collaboration diagram for SGStep:

Public Member Functions
	SGStep (const vector< list< SGAction_MaxMinMax >::const_iterator > &_actionTuple, const vector< SG::Regime > &_regimeTuple, const SGTuple &_pivot, const SGHyperplane &_hyperplane, const vector< list< SGAction_MaxMinMax > > &actions)
	Constructor.
const SGTuple &	getPivot () const
const vector< int > &	getActionTuple () const
const vector< SG::Regime > &	getRegimeTuple () const
const SGHyperplane &	getHyperplane () const
template<class Archive >
void	serialize (Archive &ar, const unsigned int version)
	Serialize the iteration using Boost.

Private Attributes
SGTuple	pivot
SGHyperplane	hyperplane
vector< int >	actionTuple
vector< SG::Regime >	regimeTuple

Friends
class	boost::serialization::access
	Serializes the SGStep object using boost.

Detailed Description

A single step of the max-min-max algorithm.

< This class records the computation of a single "pivot" of the max-min-max algorithm, where we compute the optimum in a single direction. Used by SGIteration_MaxMinMax.

Member Data Documentation

actionTuple

vector<int> SGStep::actionTuple

private

The optimal actions. Note that these are given by indices in the actions array, not the primitive action in the game.

hyperplane

SGHyperplane SGStep::hyperplane

private

The hyperplanes that define the approximation.

pivot

SGTuple SGStep::pivot

private

The pivot tuple.

regimeTuple

vector<SG::Regime> SGStep::regimeTuple

private

The optimal regimes.

---

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

• src/hpp/sgstep.hpp