Top- Based Adaptive Enumeration in Constraint Programming

Table 2

Search process indicators.

Name	Weight	Description
VFP	50	Number of variables fixed by propagation.
	10	Number of steps since the last time that an enumeration strategy; was used until step .
SB		Number of shallow backtracks [20]
		Number of backtracks.
In1	10	Represents a variation of the maximum depth. It is calculated as
		Current  Maximum  Depth − Previous  Maximum  Depth
In2	10	Calculated as Current  Depth − Previous  Depth. A positive value means that the current node is deeper than the one explored at the previous step.
Thrash	−20	The solving process alternates enumerations and backtracks on a small number of variables without succeeding in having a strong orientation. It is calculated as , where is the current depth in the search in a given time .