V - Variable
T - Value
All Implemented Interfaces:
DbtValueSelection<V extends Variable<V,T>,T extends Value<V,T>>
Selection of a value for dynamic backtracking.
Returns null if all values of the selected variable are nogood.
Selected the best good value (according to the parameters) of the selected variable.
It is based on a weighted sum of several criteria.
This IFS solver value selection heuristics is to be used only in case of
dynamic backtracking and it has the following parameters:
Minimal Perturbation Problem
Limit on the number of perturbations (only in case of MPP, i.e., when
General.MPP=true). MPP limit is decreased when a complete solution is found.
If set to -1, it is no used
Probability of selection of initial value (only in case of MPP)
Weight of difference in the number of assignments of initial values in
case of selection of the value(only in case of MPP)
Probability of random selection of a good value
Weight of the number of previous assignments of the value
Weight of the value itself (e.g., for minCSP)
Version: IFS 1.3 (Iterative Forward Search)
Copyright (C) 2006 - 2014 Tomáš Müller
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 3 of the
License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not see
Methods inherited from class java.lang.
Object clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait