use of core.mino.MinoFactory in project solution-finder by knewjade.
the class OperationWithKeyComparatorTest method compareDiffUsingKey.
@Test
void compareDiffUsingKey() throws Exception {
Randoms randoms = new Randoms();
MinoFactory minoFactory = new MinoFactory();
int x = randoms.nextInt(10);
int y = randoms.nextInt(20);
long deleteKey = 0L;
long usingKey = 1049600L;
OperationWithKey operationWithKey1 = new FullOperationWithKey(minoFactory.create(Piece.I, Rotate.Spawn), x, y, deleteKey, usingKey);
Mino newMino = new MinoFactory().create(Piece.I, Rotate.Spawn);
Long choose = randoms.key();
OperationWithKey operationWithKey2 = createNewOperationWithKey(newMino, x, y, deleteKey, choose);
// assert is 0
OperationWithKeyComparator<OperationWithKey> comparator = new OperationWithKeyComparator<>();
int compare1 = comparator.compare(operationWithKey1, operationWithKey2);
assertThat(compare1).as(operationWithKey1.toString()).isEqualTo(0);
int compare2 = comparator.compare(operationWithKey2, operationWithKey1);
assertThat(compare2).as(operationWithKey2.toString()).isEqualTo(0);
}
use of core.mino.MinoFactory in project solution-finder by knewjade.
the class OperationWithKeyComparatorTest method compareDiffY.
@Test
void compareDiffY() throws Exception {
Randoms randoms = new Randoms();
MinoFactory minoFactory = new MinoFactory();
int x = randoms.nextInt(10);
int y = randoms.nextInt(20);
long deleteKey = 0L;
long usingKey = 1049600L;
OperationWithKey operationWithKey1 = new FullOperationWithKey(minoFactory.create(Piece.I, Rotate.Spawn), x, y, deleteKey, usingKey);
int newY = randoms.nextInt(20);
if (newY == y)
newY += 1;
Mino newMino = new MinoFactory().create(Piece.I, Rotate.Spawn);
OperationWithKey operationWithKey2 = createNewOperationWithKey(newMino, x, newY, deleteKey, usingKey);
// assert is not 0 & sign reversed
OperationWithKeyComparator comparator = new OperationWithKeyComparator();
assertThat(comparator.compare(operationWithKey1, operationWithKey2) * comparator.compare(operationWithKey2, operationWithKey1)).as(operationWithKey2.toString()).isLessThan(0);
}
use of core.mino.MinoFactory in project solution-finder by knewjade.
the class CheckerNoHoldCountTest method runTestCase.
private AnalyzeTree runTestCase(PatternGenerator blocksGenerator, int maxClearLine, int maxDepth, String marks) {
Field field = FieldFactory.createField(marks);
// Initialize
MinoFactory minoFactory = new MinoFactory();
MinoShifter minoShifter = new MinoShifter();
MinoRotation minoRotation = new MinoRotation();
PerfectValidator validator = new PerfectValidator();
CheckerNoHold<Action> checker = new CheckerNoHold<>(minoFactory, validator);
// Measure
Candidate<Action> candidate = new LockedCandidate(minoFactory, minoShifter, minoRotation, maxClearLine);
AnalyzeTree tree = new AnalyzeTree();
blocksGenerator.blocksStream().forEach(blocks -> {
List<Piece> pieceList = blocks.getPieces();
boolean result = checker.check(field, pieceList, candidate, maxClearLine, maxDepth);
tree.set(result, pieceList);
});
return tree;
}
use of core.mino.MinoFactory in project solution-finder by knewjade.
the class CheckerUsingHoldCountTest method testTemplate.
@Test
void testTemplate() throws Exception {
// Invoker
List<Piece> pieces = Arrays.asList(I, T, S, Z, J, L, O);
int popCount = 4;
int maxClearLine = 4;
int maxDepth = 3;
// Field
String marks = "" + "XXXXX____X" + "XXXXXX___X" + "XXXXXXX__X" + "XXXXXX___X" + "";
Field field = FieldFactory.createField(marks);
// Initialize
MinoFactory minoFactory = new MinoFactory();
MinoShifter minoShifter = new MinoShifter();
MinoRotation minoRotation = new MinoRotation();
PerfectValidator validator = new PerfectValidator();
CheckerUsingHold<Action> checker = new CheckerUsingHold<>(minoFactory, validator);
// Measure
Candidate<Action> candidate = new LockedCandidate(minoFactory, minoShifter, minoRotation, maxClearLine);
AnalyzeTree tree = new AnalyzeTree();
Iterable<List<Piece>> combinations = new PermutationIterable<>(pieces, popCount);
for (List<Piece> combination : combinations) {
boolean result = checker.check(field, combination, candidate, maxClearLine, maxDepth);
tree.set(result, combination);
}
// Source: Nilgiri: https://docs.google.com/spreadsheets/d/1bVY3t_X96xRmUL0qdgB9tViSIGenu6RMKX4RW7qWg8Y/edit#gid=0
assertThat(tree.getSuccessPercent()).isEqualTo(514 / 840.0);
}
use of core.mino.MinoFactory in project solution-finder by knewjade.
the class CheckerUsingHoldCountTest method testBT4_5.
@Test
@LongTest
void testBT4_5() throws Exception {
// Invoker
List<Piece> pieces = Arrays.asList(I, T, S, Z, J, L, O);
int popCount = 7;
int maxClearLine = 6;
int maxDepth = 7;
// Field
String marks = "" + "XX________" + "XX________" + "XXX______X" + "XXXXXXX__X" + "XXXXXX___X" + "XXXXXXX_XX" + "";
Field field = FieldFactory.createField(marks);
// Initialize
MinoFactory minoFactory = new MinoFactory();
MinoShifter minoShifter = new MinoShifter();
MinoRotation minoRotation = new MinoRotation();
PerfectValidator validator = new PerfectValidator();
CheckerUsingHold<Action> checker = new CheckerUsingHold<>(minoFactory, validator);
// Measure
Candidate<Action> candidate = new LockedCandidate(minoFactory, minoShifter, minoRotation, maxClearLine);
AnalyzeTree tree = new AnalyzeTree();
Iterable<List<Piece>> combinations = new PermutationIterable<>(pieces, popCount);
for (List<Piece> combination : combinations) {
boolean result = checker.check(field, combination, candidate, maxClearLine, maxDepth);
tree.set(result, combination);
}
// Source: myself 20170415
assertThat(tree.getSuccessPercent()).isEqualTo(5038 / 5040.0);
}
Aggregations