//==============================================================================
//	
//	Copyright (c) 2013-
//	Authors:
//	* Dave Parker <david.parker@comlab.ox.ac.uk> (University of Oxford)
//	* Mateusz Ujma <mateusz.ujma@cs.ox.ac.uk> (University of Oxford)
//	
//------------------------------------------------------------------------------
//	
//	This file is part of PRISM.
//	
//	PRISM is free software; you can redistribute it and/or modify
//	it under the terms of the GNU General Public License as published by
//	the Free Software Foundation; either version 2 of the License, or
//	(at your option) any later version.
//	
//	PRISM is distributed in the hope that it will be useful,
//	but WITHOUT ANY WARRANTY; without even the implied warranty of
//	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//	GNU General Public License for more details.
//	
//	You should have received a copy of the GNU General Public License
//	along with PRISM; if not, write to the Free Software Foundation,
//	Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//	
//==============================================================================

package heuristics.search;

import heuristics.ECContainer;
import heuristics.HeuristicsSMGModelChecker;
import heuristics.nextstate.HeuristicNextState;
import heuristics.update.StateUpdate;
import explicit.ModelExplorer;
import parser.State;
import prism.PrismException;

/*
 * Implementation of the RTDP heuristic. 
 * 
 */

public class HeuristicRTDP extends Heuristic{

	public HeuristicRTDP(HeuristicsSMGModelChecker mc, StateUpdate su, ECContainer eCC, HeuristicNextState nextState, ModelExplorer pme, boolean min, boolean collapseMECs) throws PrismException{
		super(mc, su, eCC, nextState, pme, min, collapseMECs);
	}
	
	@Override
	public void heuristicStep(State s) throws PrismException {
		int depth = 0;
		while(!stateUpdate.isTarget(s) && !stateUpdate.isOnlySelfLoop(s) && depth < bound) {
			int bestAction = stateUpdate.update(s, depth);
			s = nextState.sample(s,bestAction, depth);
			depth++;
			trialSteps++;
		}
		stateUpdate.setTargetOrBoundValue(s, depth);
		if(trials % reportEvery == 0) {
			reportProgress(trials, trialSteps, false);
		}
		trials++;
	}
}