ra/runelite
1
0
Fork 0
Code Issues Pull Requests Actions 3 Packages Projects Releases Wiki Activity

puzzle solver: add lightbox solver

Browse Source
This commit is contained in:
Adam
2018-07-01 10:29:15 -04:00
parent 054e69c434
commit 36b68a6254
9 changed files with 641 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

144
runelite-client/src/test/java/net/runelite/client/plugins/puzzlesolver/lightbox/LightboxSolverTest.java Normal file
View File

@@ -0,0 +1,144 @@
/*
* Copyright (c) 2018, Adam <Adam@sigterm.info>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT OWNER OR 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 net.runelite.client.plugins.puzzlesolver.lightbox;
import static org.junit.Assert.assertEquals;
import org.junit.Test;
public class LightboxSolverTest
{
private static final int[] INITIAL = new int[]{
1, 0, 1, 0, 0,
0, 1, 0, 1, 0,
0, 1, 1, 1, 0,
0, 1, 0, 1, 0,
1, 0, 1, 0, 1
};
private static final int[] A = new int[]{
0, 1, 0, 0, 0,
0, 0, 0, 0, 1,
0, 1, 0, 1, 0,
0, 0, 0, 1, 0,
0, 0, 0, 0, 1
};
private static final int[] B = new int[]{
0, 1, 0, 0, 0,
1, 0, 0, 0, 1,
0, 0, 0, 1, 0,
1, 1, 0, 1, 0,
0, 0, 0, 1, 1,
};
private static final int[] C = new int[]{
0, 1, 0, 0, 0,
1, 0, 0, 0, 1,
1, 1, 0, 0, 0,
0, 1, 0, 0, 0,
0, 0, 0, 0, 1,
};
private static final int[] D = new int[]{
1, 1, 0, 0, 0,
1, 0, 1, 0, 1,
1, 1, 0, 1, 1,
0, 1, 1, 0, 0,
1, 0, 0, 1, 1,
};
private static final int[] E = new int[]{
1, 0, 0, 1, 0,
1, 1, 1, 0, 1,
1, 1, 0, 1, 0,
0, 0, 1, 0, 0,
1, 0, 0, 1, 1,
};
private static final int[] F = new int[]{
1, 0, 0, 1, 0,
1, 0, 0, 0, 1,
1, 0, 1, 1, 0,
0, 0, 1, 0, 0,
1, 0, 0, 0, 0,
};
private static final int[] G = new int[]{
1, 0, 0, 1, 1,
1, 1, 1, 0, 0,
0, 1, 1, 1, 0,
0, 0, 0, 0, 1,
1, 1, 0, 0, 0,
};
private static final int[] H = new int[]{
1, 0, 1, 1, 1,
1, 1, 1, 0, 0,
0, 1, 1, 1, 0,
1, 1, 0, 0, 1,
1, 0, 0, 1, 0
};
private static LightboxState fromArray(int[] array)
{
LightboxState s = new LightboxState();
assert array.length == 25;
for (int i = 0; i < array.length; ++i)
{
s.setState(i / 5, i % 5, array[i] != 0);
}
return s;
}
@Test
public void test()
{
LightboxSolver solver = new LightboxSolver();
solver.setInitial(fromArray(INITIAL));
solver.setSwitchChange(Combination.A, fromArray(A));
solver.setSwitchChange(Combination.B, fromArray(B));
solver.setSwitchChange(Combination.C, fromArray(C));
solver.setSwitchChange(Combination.D, fromArray(D));
solver.setSwitchChange(Combination.E, fromArray(E));
solver.setSwitchChange(Combination.F, fromArray(F));
solver.setSwitchChange(Combination.G, fromArray(G));
solver.setSwitchChange(Combination.H, fromArray(H));
LightboxSolution solution = solver.solve();
LightboxSolution expected = new LightboxSolution();
expected.flip(Combination.A);
expected.flip(Combination.B);
expected.flip(Combination.D);
expected.flip(Combination.E);
expected.flip(Combination.F);
expected.flip(Combination.G);
assertEquals(expected, solution);
}
}