public class MoveBinaryDDS extends MoveBinaryLDS
[1]:T. Walsh, Depth-bounded Discrepancy Search, IJCAI-97.
Note that the depth is not maintained since it is useful only when max discrepancy is greater than max depth, which should not happen. Created by cprudhom on 07/10/15. Project: choco.
dis, DIS
strategy, topDecisionPosition
Constructor and Description |
---|
MoveBinaryDDS(AbstractStrategy strategy,
int discrepancy,
IEnvironment environment)
Create a DFS with binary decisions
|
Modifier and Type | Method and Description |
---|---|
boolean |
extend(Solver solver)
Performs a move when the CSP associated to the current node of the search space is not proven to be not consistent.
|
init, repair, rewind
getChildMoves, getStrategy, prevDecision, setChildMoves, setStrategy, setTopDecisionPosition
public MoveBinaryDDS(AbstractStrategy strategy, int discrepancy, IEnvironment environment)
strategy
- how (binary) decisions are selecteddiscrepancy
- maximum discrepancyenvironment
- backtracking environmentpublic boolean extend(Solver solver)
Move
extend
in interface Move
extend
in class MoveBinaryDFS
solver
- reference the solvertrue
if an extension can be done, false
when no more extension is possible.Copyright © 2018. All rights reserved.