tour/puzzle-generator
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

introduce bitloops

Browse Source
This commit is contained in:
mike
2026-01-20 23:24:24 +01:00
parent 7f15ab8ff1
commit 46b2bb04dc
6 changed files with 50 additions and 127 deletions
Download Patch File Download Diff File Expand all files Collapse all files

55
src/test/java/puzzle/SwedishGeneratorTest.java
View File

@@ -13,9 +13,8 @@ import puzzle.Masker.Slot;
import static org.junit.jupiter.api.Assertions.*;
import static precomp.Const9x8.*;
import static precomp.Const9x8.Cell.r0c0d1;
import static precomp.Const9x8.Cell.*;
import static puzzle.SwedishGenerator.*;
import static puzzle.SwedishGeneratorTest.Idx.IDX_0_0;
public class SwedishGeneratorTest {
@@ -80,52 +79,11 @@ public class SwedishGeneratorTest {
static final byte D_BYTE_2 = CLUE_RIGHT;
enum Idx {
IDX_0_0(OFF_0_0, 0, 0),
IDX_0_1(OFF_0_1, 0, 1),
IDX_0_2(OFF_0_2, 0, 2),
IDX_0_3(OFF_0_3, 0, 3),
IDX_0_4(OFF_0_4, 0, 4),
IDX_0_5(OFF_0_5, 0, 5),
IDX_1_0(OFF_1_0, 1, 0),
IDX_1_1(OFF_1_1, 1, 1),
IDX_1_2(OFF_1_2, 1, 2),
IDX_1_3(OFF_1_3, 1, 3),
IDX_1_4(OFF_1_4, 1, 4),
IDX_1_5(OFF_1_5, 1, 5),
IDX_2_0(OFF_2_0, 2, 0),
IDX_2_1(OFF_2_1, 2, 1),
IDX_2_2(OFF_2_2, 2, 2),
IDX_2_3(OFF_2_3, 2, 3),
IDX_2_4(OFF_2_4, 2, 4),
IDX_2_5(OFF_2_5, 2, 5),
IDX_3_0(OFF_3_0, 3, 0),
IDX_3_1(OFF_3_1, 3, 1),
IDX_3_2(OFF_3_2, 3, 2),
IDX_3_3(OFF_3_3, 3, 3),
IDX_3_4(OFF_3_4, 3, 4),
IDX_3_5(OFF_3_5, 3, 5);
Idx(int idx, int r, int c) {
this.index = idx;
this.r = r;
this.c = c;
if (isLo(idx)) {
this.lo = 1L << idx;
this.hi = 0L;
} else {
this.lo = 0L;
this.hi = 1L << (idx & 63);
}
}
final int index, r, c;
final long lo, hi;
}
@Test
void testPatternForSlotAllLetters() {
var key = Slot.packSlotKey(OFF_0_0, CLUE_RIGHT);
val clues = Masker.Clues.createEmpty();
var key = r0c0d1.slotKey;
val clues = Clues.of(r0c0d1);
var grid = new Gridded(clues);
clues.setClueLo(IDX_0_0.lo, CLUE_RIGHT);
GridBuilder.placeWord(grid.grid(), grid.grid().g, key, (1L << OFF_0_1) | (1L << OFF_0_2) | (1L << OFF_0_3), 0L, ABC);
val map = grid.stream(clues).collect(Collectors.toMap(LetterAt::index, LetterAt::letter));
assertEquals(LETTER_A, map.get(OFF_0_1));
@@ -288,8 +246,7 @@ public class SwedishGeneratorTest {
@Test
void testForEachSlotAndExtractSlots() {
// This should detect a slot starting at 0,1 with length 2 (0,1 and 0,2)
var clues = Masker.Clues.createEmpty();
clues.setClueLo(IDX_0_0.lo, CLUE_RIGHT);
var clues = Clues.of(r0c0d1);
var dict = DictJavaGeneratorMulti.Dicts.makeDict(WORDS2);
var slots = Masker.extractSlots(clues, dict.index());
assertEquals(1, slots.length);
@@ -309,7 +266,7 @@ public class SwedishGeneratorTest {
assertTrue(f1 >= 1_000_000_000L);
// Add a slot
grid.setClueLo(IDX_0_0.lo, D_BYTE_2);
grid.setClue(r0c0d1);
var f2 = gen.maskFitness(grid, 18);
assertTrue(f2 < f1);
}
@@ -437,7 +394,7 @@ public class SwedishGeneratorTest {
// Empty grid: huge penalty
var fitEmpty = gen.maskFitness(grid, 18);
assertTrue(fitEmpty >= 1_000_000_000L);
grid.setClueLo(IDX_0_0.lo, D_BYTE_2); // Right from 0,0. Len 2 if 3x3.
grid.setClue(r0c0d1); // Right from 0,0. Len 2 if 3x3.
var fitOne = gen.maskFitness(grid, 18);
assertTrue(fitOne < fitEmpty);
}