/**
* Copyright (c) 1999-2014, Ecole des Mines de Nantes
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the Ecole des Mines de Nantes nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package solver.constraints.nary;
import org.testng.Assert;
import org.testng.annotations.Test;
import solver.Solver;
import solver.constraints.nary.nogood.NogoodStoreFromRestarts;
import solver.search.limits.BacktrackCounter;
import solver.search.limits.ICounterAction;
import solver.search.loop.monitors.SMF;
import solver.search.strategy.ISF;
import solver.variables.IntVar;
import solver.variables.VF;
/**
* <br/>
*
* @author Charles Prud'homme
* @since 20/06/13
*/
public class NogoodTest {
@Test(groups = "1s")
public void test1() {
final Solver solver = new Solver();
IntVar[] vars = VF.enumeratedArray("vars", 3, 0, 2, solver);
NogoodStoreFromRestarts ngs = new NogoodStoreFromRestarts(vars);
solver.post(ngs);
solver.set(ISF.random_value(vars, 29091981L));
final BacktrackCounter sc = new BacktrackCounter(30);
sc.setAction(new ICounterAction() {
@Override
public void onLimitReached() {
solver.getSearchLoop().restart();
sc.reset();
}
});
solver.getSearchLoop().plugSearchMonitor(sc);
solver.getSearchLoop().plugSearchMonitor(ngs);
SMF.limitTime(solver, 200000);
solver.findAllSolutions();
Assert.assertEquals(solver.getMeasures().getSolutionCount(), 29);
Assert.assertEquals(solver.getMeasures().getBackTrackCount(), 53);
}
@Test(groups = "1s")
public void test2() {
final Solver solver = new Solver();
IntVar[] vars = VF.enumeratedArray("vars", 3, 0, 3, solver);
NogoodStoreFromRestarts ngs = new NogoodStoreFromRestarts(vars);
solver.post(ngs);
solver.set(ISF.random_value(vars, 29091981L));
final BacktrackCounter sc = new BacktrackCounter(32);
sc.setAction(new ICounterAction() {
@Override
public void onLimitReached() {
solver.getSearchLoop().restart();
sc.reset();
}
});
solver.getSearchLoop().plugSearchMonitor(sc);
solver.getSearchLoop().plugSearchMonitor(ngs);
SMF.limitTime(solver, 2000);
solver.findAllSolutions();
Assert.assertEquals(solver.getMeasures().getSolutionCount(), 75);
Assert.assertEquals(solver.getMeasures().getBackTrackCount(), 137);
}
}