Skip to content

Commit

Permalink
Start first Clashing Orbit contradiction rule test
Browse files Browse the repository at this point in the history
  • Loading branch information
summerhenson committed Jun 7, 2024
1 parent 3abd581 commit ebc20df
Show file tree
Hide file tree
Showing 2 changed files with 98 additions and 0 deletions.
Original file line number Diff line number Diff line change
@@ -0,0 +1,58 @@
package puzzles.starbattle.rules;

import edu.rpi.legup.puzzle.nurikabe.NurikabeBoard;
import edu.rpi.legup.puzzle.starbattle.rules.ClashingOrbitContradictionRule;
import edu.rpi.legup.model.tree.TreeNode;
import edu.rpi.legup.model.tree.TreeTransition;
import edu.rpi.legup.puzzle.starbattle.StarBattle;
import edu.rpi.legup.puzzle.starbattle.StarBattleBoard;
import edu.rpi.legup.puzzle.starbattle.StarBattleCell;
import edu.rpi.legup.puzzle.starbattle.StarBattleCellType;
import edu.rpi.legup.save.InvalidFileFormatException;
import java.awt.*;
import legup.MockGameBoardFacade;
import legup.TestUtilities;
import org.junit.Assert;
import org.junit.BeforeClass;
import org.junit.Test;

public class ClashingOrbitContradictionRuleTest {

private static final ClashingOrbitContradictionRule RULE = new ClashingOrbitContradictionRule();
private static StarBattle starBattle;

@BeforeClass
public static void setUp() {
MockGameBoardFacade.getInstance();
starBattle = new StarBattle();
}

/*Tests the Clashing Orbit contradiction rule*/
@Test
public void ClashingOrbitContradictionRule_DirectlyAdjacentCenter()
throws InvalidFileFormatException
{
TestUtilities.importTestBoard("puzzles/starbattle.rules/ClashingOrbitContradictionRule/DirectlyAdjacentCenter", starBattle);
TreeNode rootNode = starBattle.getTree().getRootNode();
TreeTransition transition = rootNode.getChildren().get(0);
transition.setRule(RULE);

StarBattleBoard board = (StarBattleBoard) transition.getBoard();
StarBattleCell cell1 = board.getCell(1,1);
StarBattleCell cell2 = board.getCell(2,1);

Assert.assertNull(RULE.checkContradiction((StarBattleBoard) transition.getBoard()));

for (int i = 0; i < board.getHeight(); ++i) {
for (int j = 0; j < board.getWidth(); ++j) {
Point point = new Point(j,i);
if (point.equals(cell1.getLocation()) || point.equals(cell2.getLocation())) {
Assert.assertNull(RULE.checkRuleAt(transition, board.getCell(j, i)));
}
else {
Assert.assertNotNull(RULE.checkRuleAt(transition, board.getCell(j, i)));
}
}
}
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
<?xml version="1.0" encoding="UTF-8" standalone="no" ?>
<Legup version="2.0.0">
<puzzle name="StarBattle">
<board size="4" puzzle_num="1">
<region>
<cells>
<cell value="0" x="0" y="2">
<cell value="0" x="1" y="2">
<cell value="0" x="0" y="3">
<cell value="0" x="1" y="3">
</cells>
</region>
<region>
<cells>
<cell value="0" x="2" y="2">
<cell value="0" x="3" y="2">
<cell value="0" x="2" y="3">
<cell value="0" x="3" y="3">
</cells>
</region>
<region>
<cells>
<cell value="0" x="0" y="0">
<cell value="0" x="1" y="0">
<cell value="0" x="0" y="1">
<cell value="-2" x="1" y="1">
</cells>
</region>
<region>
<cells>
<cell value="0" x="2" y="0">
<cell value="0" x="3" y="0">
<cell value="-2" x="2" y="1">
<cell value="0" x="3" y="1">
</cells>
</region>
</board>
</puzzle>
<solved isSolved="false" lastSaved="--"/>
</Legup>

0 comments on commit ebc20df

Please sign in to comment.