use of common.pattern.PatternGenerator in project solution-finder by knewjade.
the class CheckerUsingHoldInvokerTest method testSearch4.
@ParameterizedTest
@ArgumentsSource(InvokerTestCase.class)
void testSearch4(IntFunction<ConcurrentCheckerInvoker> invokerGenerator) throws Exception {
PatternGenerator blocksGenerator = new LoadedPatternGenerator("*p4");
int maxClearLine = 3;
int maxDepth = 3;
String marks = "" + "XXX____XXX" + "XXX_____XX" + "XXXX___XXX" + "";
ConcurrentCheckerInvoker invoker = invokerGenerator.apply(maxClearLine);
AnalyzeTree tree = runTestCase(invoker, marks, blocksGenerator, maxClearLine, maxDepth);
// Source: myself 20170415
assertThat(tree.getSuccessPercent()).isEqualTo(434 / 840.0);
}
use of common.pattern.PatternGenerator in project solution-finder by knewjade.
the class CheckerUsingHoldInvokerTest method testSearch6.
@ParameterizedTest
@ArgumentsSource(InvokerTestCase.class)
void testSearch6(IntFunction<ConcurrentCheckerInvoker> invokerGenerator) throws Exception {
PatternGenerator blocksGenerator = new LoadedPatternGenerator("*p5");
int maxClearLine = 4;
int maxDepth = 4;
String marks = "" + "XXXXXX____" + "XXXXXX____" + "XXXXXX____" + "XXXXXX____" + "";
ConcurrentCheckerInvoker invoker = invokerGenerator.apply(maxClearLine);
AnalyzeTree tree = runTestCase(invoker, marks, blocksGenerator, maxClearLine, maxDepth);
// Source: twitter by @???
assertThat(tree.getSuccessPercent()).isEqualTo(1776 / 2520.0);
}
use of common.pattern.PatternGenerator in project solution-finder by knewjade.
the class CheckerUsingHoldInvokerTest method random.
@LongTest
@ParameterizedTest
@ArgumentsSource(InvokerTestCase.class)
void random(IntFunction<ConcurrentCheckerInvoker> invokerGenerator) throws FinderExecuteException, SyntaxException {
Randoms randoms = new Randoms();
MinoFactory minoFactory = new MinoFactory();
MinoShifter minoShifter = new MinoShifter();
MinoRotation minoRotation = new MinoRotation();
PerfectValidator validator = new PerfectValidator();
CheckerUsingHold<Action> checker = new CheckerUsingHold<>(minoFactory, validator);
for (int count = 0; count < 20; count++) {
int maxClearLine = randoms.nextInt(3, 6);
int maxDepth = randoms.nextIntClosed(3, 5);
Candidate<Action> candidate = new LockedCandidate(minoFactory, minoShifter, minoRotation, maxClearLine);
Field field = randoms.field(maxClearLine, maxDepth);
PatternGenerator blocksGenerator = createPiecesGenerator(maxDepth);
List<Pieces> searchingPieces = blocksGenerator.blocksStream().collect(Collectors.toList());
Injector injector = Guice.createInjector(new BasicModule(maxClearLine));
ExecutorService executorService = injector.getInstance(ExecutorService.class);
ConcurrentCheckerInvoker invoker = invokerGenerator.apply(maxClearLine);
List<Pair<Pieces, Boolean>> resultPairs = invoker.search(field, searchingPieces, maxClearLine, maxDepth);
// 結果を集計する
AnalyzeTree tree1 = new AnalyzeTree();
for (Pair<Pieces, Boolean> resultPair : resultPairs) {
Pieces pieces1 = resultPair.getKey();
Boolean result = resultPair.getValue();
tree1.set(result, pieces1);
}
System.out.println(tree1.show());
executorService.shutdown();
AnalyzeTree tree = tree1;
for (Pieces pieces : searchingPieces) {
boolean check = checker.check(field, pieces.getPieces(), candidate, maxClearLine, maxDepth);
assertThat(tree.isSucceed(pieces)).isEqualTo(check);
}
}
}
use of common.pattern.PatternGenerator in project solution-finder by knewjade.
the class SetupEntryPoint method run.
@Override
public void run() throws FinderException {
output("# Setup Field");
// Setup init field
Field initField = settings.getInitField();
Verify.field(initField);
// Setup need filled field
Field needFilledField = settings.getNeedFilledField();
Verify.needFilledField(needFilledField);
// Setup not filled field
Field notFilledField = settings.getNotFilledField();
// Setup max height
int maxHeight = settings.getMaxHeight();
Verify.maxClearLineUnder10(maxHeight);
// Setup reserved blocks
BlockField reservedBlocks = settings.getReservedBlock();
if (settings.isReserved()) {
Verify.reservedBlocks(reservedBlocks);
for (int y = maxHeight - 1; 0 <= y; y--) {
StringBuilder builder = new StringBuilder();
for (int x = 0; x < 10; x++) {
if (reservedBlocks.getBlock(x, y) != null)
builder.append(reservedBlocks.getBlock(x, y).getName());
else if (!initField.isEmpty(x, y))
builder.append('X');
else if (!needFilledField.isEmpty(x, y))
builder.append('*');
else if (!notFilledField.isEmpty(x, y))
builder.append('_');
else
builder.append('.');
}
output(builder.toString());
}
} else {
for (int y = maxHeight - 1; 0 <= y; y--) {
StringBuilder builder = new StringBuilder();
for (int x = 0; x < 10; x++) {
if (!initField.isEmpty(x, y))
builder.append('X');
else if (!needFilledField.isEmpty(x, y))
builder.append('*');
else if (!notFilledField.isEmpty(x, y))
builder.append('_');
else
builder.append('.');
}
output(builder.toString());
}
}
// Setup min depth
// 最低でも必要なミノ数
int minDepth = Verify.minDepth(needFilledField);
output();
// ========================================
// Output user-defined
DropType dropType = settings.getDropType();
output("# Initialize / User-defined");
output("Max height: " + maxHeight);
output("Drop: " + dropType.name().toLowerCase());
output("Searching patterns:");
// Setup patterns
List<String> patterns = settings.getPatterns();
PatternGenerator generator = Verify.patterns(patterns, minDepth);
// Output patterns
for (String pattern : patterns) output(" " + pattern);
// Setup output file
MyFile base = new MyFile(settings.getOutputBaseFilePath());
base.mkdirs();
base.verify();
output();
// ========================================
// Setup core
output("# Initialize / System");
int core = Runtime.getRuntime().availableProcessors();
// Output system-defined
output("Version = " + FinderConstant.VERSION);
output("Available processors = " + core);
output("Need Pieces = " + minDepth);
output();
// ========================================
output("# Search");
output(" -> Stopwatch start");
Stopwatch stopwatch = Stopwatch.createStartedStopwatch();
// Initialize
MinoFactory minoFactory = new MinoFactory();
MinoShifter minoShifter = new MinoShifter();
ColorConverter colorConverter = new ColorConverter();
SizedBit sizedBit = decideSizedBitSolutionWidth(maxHeight);
TaskResultHelper taskResultHelper = new BasicMinoPackingHelper();
SolutionFilter solutionFilter = new ForPathSolutionFilter(generator, maxHeight);
ThreadLocal<BuildUpStream> buildUpStreamThreadLocal = createBuildUpStreamThreadLocal(dropType, maxHeight);
OneFumenParser fumenParser = new OneFumenParser(minoFactory, colorConverter);
// ミノリストの作成
long deleteKeyMask = getDeleteKeyMask(notFilledField, maxHeight);
SeparableMinos separableMinos = SeparableMinos.createSeparableMinos(minoFactory, minoShifter, sizedBit, deleteKeyMask);
// 絶対に置かないブロック
List<InOutPairField> inOutPairFields = InOutPairField.createInOutPairFields(sizedBit, notFilledField);
// 絶対に置く必要があるブロック
ArrayList<BasicSolutions> basicSolutions = new ArrayList<>();
List<ColumnField> needFillFields = InOutPairField.createInnerFields(sizedBit, needFilledField);
{
Field freeze = needFilledField.freeze(sizedBit.getHeight());
for (ColumnField innerField : needFillFields) {
// 最小限の部分だけを抽出する
Field freeze1 = freeze.freeze(sizedBit.getHeight());
for (int y = 0; y < sizedBit.getHeight(); y++) {
int width = sizedBit.getWidth();
for (int x = 0; x < width; x++) freeze1.removeBlock(x, y);
for (int x = width + 3; x < 10; x++) freeze1.removeBlock(x, y);
}
OnDemandBasicSolutions solutions = new OnDemandBasicSolutions(separableMinos, sizedBit, innerField.getBoard(0), freeze1);
basicSolutions.add(solutions);
freeze.slideLeft(sizedBit.getWidth());
}
}
// 探索
SetupPackSearcher searcher = new SetupPackSearcher(inOutPairFields, basicSolutions, sizedBit, solutionFilter, taskResultHelper, needFillFields);
List<Result> results = getResults(initField, sizedBit, buildUpStreamThreadLocal, searcher);
output(" Found solution = " + results.size());
stopwatch.stop();
output(" -> Stopwatch stop : " + stopwatch.toMessage(TimeUnit.MILLISECONDS));
output();
// ========================================
output("# Output file");
HTMLBuilder<FieldHTMLColumn> htmlBuilder = new HTMLBuilder<>("Setup result");
results.parallelStream().forEach(result -> {
List<MinoOperationWithKey> operationWithKeys = result.getMemento().getSeparableMinoStream(sizedBit.getWidth()).map(SeparableMino::toMinoOperationWithKey).collect(Collectors.toList());
Field allField = initField.freeze(maxHeight);
Operations operations = OperationTransform.parseToOperations(allField, operationWithKeys, sizedBit.getHeight());
List<? extends Operation> operationList = operations.getOperations();
for (Operation operation : operationList) {
Mino mino = minoFactory.create(operation.getPiece(), operation.getRotate());
int x = operation.getX();
int y = operation.getY();
allField.put(mino, x, y);
}
// 譜面の作成
String encode = fumenParser.parse(operationWithKeys, initField, maxHeight);
String name = operationWithKeys.stream().map(OperationWithKey::getPiece).map(Piece::getName).collect(Collectors.joining());
String link = String.format("<a href='http://fumen.zui.jp/?v115@%s' target='_blank'>%s</a>", encode, name);
String line = String.format("<div>%s</div>", link);
htmlBuilder.addColumn(new FieldHTMLColumn(allField, maxHeight), line);
});
ArrayList<FieldHTMLColumn> columns = new ArrayList<>(htmlBuilder.getRegisteredColumns());
columns.sort(Comparator.comparing(FieldHTMLColumn::getTitle).reversed());
try (BufferedWriter bufferedWriter = base.newBufferedWriter()) {
for (String line : htmlBuilder.toList(columns, true)) {
bufferedWriter.write(line);
bufferedWriter.newLine();
}
bufferedWriter.flush();
} catch (IOException e) {
throw new FinderExecuteException(e);
}
output();
// ========================================
output("# Finalize");
output("done");
}
use of common.pattern.PatternGenerator in project solution-finder by knewjade.
the class CheckerNoHoldCountTest method testCase4.
@Test
void testCase4() throws Exception {
// Invoker
PatternGenerator blocksGenerator = new LoadedPatternGenerator("*p7");
int maxClearLine = 4;
int maxDepth = 6;
// Field
String marks = "" + "XXXX______" + "XXXX______" + "XXXX______" + "XXXX______" + "";
AnalyzeTree tree = runTestCase(blocksGenerator, maxClearLine, maxDepth, marks);
// Source: myself 20170415
assertThat(tree.getSuccessPercent()).isEqualTo(1902 / 5040.0);
}
Aggregations