2021-11-19 08:32:32 +01:00
|
|
|
package ch.zhaw.catan;
|
|
|
|
|
2021-12-08 14:39:19 +01:00
|
|
|
import static org.junit.jupiter.api.Assertions.assertEquals;
|
2021-12-10 11:02:34 +01:00
|
|
|
import static org.junit.jupiter.api.Assertions.assertThrows;
|
2021-12-05 13:53:36 +01:00
|
|
|
|
2021-12-09 16:14:47 +01:00
|
|
|
import org.junit.jupiter.api.*;
|
2021-12-10 11:02:34 +01:00
|
|
|
import org.junit.jupiter.params.ParameterizedTest;
|
|
|
|
import org.junit.jupiter.params.provider.ValueSource;
|
2021-11-19 08:32:32 +01:00
|
|
|
|
2021-12-05 13:53:36 +01:00
|
|
|
import java.awt.*;
|
2021-12-09 16:05:46 +01:00
|
|
|
import java.util.*;
|
|
|
|
import java.util.List;
|
2021-12-05 13:53:36 +01:00
|
|
|
|
2021-12-10 11:45:57 +01:00
|
|
|
/**
|
|
|
|
* @class SiedlerGameTest
|
|
|
|
*
|
|
|
|
* contains all of the test cases for SiedlerGame class.
|
|
|
|
* The Test cases are categorized into
|
|
|
|
* - Positive TestCases
|
|
|
|
* Tests the methods of SiedlerGame with the intended values
|
|
|
|
*
|
|
|
|
* - Negative TestCases
|
|
|
|
* Tests the methods of SiedlerGame with values, that results to errors and failure
|
|
|
|
*
|
|
|
|
* - SystemTestCases
|
|
|
|
* Tests the coordination of all methods and simulates a game with all moves programmed
|
|
|
|
* Checks if the methods are being executed and the values are set correctly
|
|
|
|
*/
|
2021-11-19 08:32:32 +01:00
|
|
|
public class SiedlerGameTest {
|
|
|
|
|
2021-12-09 16:14:47 +01:00
|
|
|
private final static int DEFAULT_WINPOINTS = 5;
|
2021-12-08 14:39:19 +01:00
|
|
|
private final static int DEFAULT_PLAYERAMOUNT = 4;
|
2021-11-19 08:32:32 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
|
|
|
* Property START_SETTLEMENT_POSITIONS
|
|
|
|
*
|
|
|
|
* Lists all positions of Settlement for every faction in the initialization phase.
|
|
|
|
* Each faction is assigned to a list of specific settlements, which represents as a list of points
|
|
|
|
*/
|
|
|
|
private final static Map<Config.Faction, ArrayList<Point>> START_SETTLEMENT_POSITIONS = Map.of(
|
|
|
|
Config.Faction.BLUE, new ArrayList<>(List.of(new Point(4, 4), new Point(5, 7))),
|
|
|
|
Config.Faction.RED, new ArrayList<>(List.of(new Point(10, 4), new Point(9, 7))),
|
|
|
|
Config.Faction.GREEN, new ArrayList<>(List.of(new Point(4, 18), new Point(5, 15))),
|
|
|
|
Config.Faction.YELLOW, new ArrayList<>(List.of(new Point(10, 18), new Point(9, 15)))
|
|
|
|
);
|
2021-12-08 15:01:33 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
2021-12-10 11:45:57 +01:00
|
|
|
* Property START_ROADS_POSITION
|
2021-12-10 11:02:34 +01:00
|
|
|
*
|
|
|
|
* Lists all endpoints of roads for every faction in the initialization phase.
|
|
|
|
* Each faction is assigned to a specific Road, which represents as a tuple of 2 points
|
|
|
|
*/
|
|
|
|
private final static Map<Config.Faction, ArrayList<Tuple<Point, Point>>> START_ROADS_POSITIONS = Map.of(
|
|
|
|
Config.Faction.BLUE, new ArrayList<>(List.of(
|
|
|
|
new Tuple<>(new Point(4, 4), new Point(4, 6)), new Tuple<>(new Point(4, 6), new Point(5, 7)))),
|
|
|
|
Config.Faction.RED, new ArrayList<>(List.of(
|
|
|
|
new Tuple<>(new Point(10, 4), new Point(10, 6)), new Tuple<>(new Point(10, 6), new Point(9, 7)))),
|
|
|
|
Config.Faction.GREEN, new ArrayList<>(List.of(
|
|
|
|
new Tuple<>(new Point(4, 18), new Point(4, 16)), new Tuple<>(new Point(4, 16), new Point(5, 15)))),
|
|
|
|
Config.Faction.YELLOW, new ArrayList<>(List.of(
|
|
|
|
new Tuple<>(new Point(10, 18), new Point(10, 16)), new Tuple<>(new Point(10, 16), new Point(9, 15))))
|
|
|
|
);
|
2021-12-08 15:01:33 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
|
|
|
* This test class contains all positive test cases.
|
|
|
|
*/
|
2021-12-09 16:14:47 +01:00
|
|
|
@Nested
|
|
|
|
@DisplayName("Positive test cases")
|
|
|
|
class PositiveTestcases {
|
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
|
|
|
* This test will check, if the game initializes with all 4 factions.
|
|
|
|
* All factions should have no resources
|
|
|
|
*/
|
|
|
|
@ParameterizedTest(name = "Test with {arguments} players")
|
|
|
|
@ValueSource(ints = {2, 3, 4})
|
|
|
|
@DisplayName("Game initializing with different amount of players within the domain (Players have no resources), expected ok")
|
|
|
|
public void TestGameInitializationWithAllPlayercounts(int playerAmount) {
|
|
|
|
SiedlerGame game = new SiedlerGame(DEFAULT_WINPOINTS, playerAmount);
|
2021-12-10 09:12:16 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
for (Config.Faction faction: game.getPlayerFactions()) {
|
|
|
|
HashMap<Config.Resource, Integer> resources = game.getCurrentPlayerResource();
|
2021-12-10 09:12:16 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
Assertions.assertEquals(0, resources.get(Config.Resource.BRICK));
|
|
|
|
Assertions.assertEquals(0, resources.get(Config.Resource.GRAIN));
|
|
|
|
Assertions.assertEquals(0, resources.get(Config.Resource.LUMBER));
|
|
|
|
Assertions.assertEquals(0, resources.get(Config.Resource.ORE));
|
|
|
|
Assertions.assertEquals(0, resources.get(Config.Resource.WOOL));
|
2021-12-10 09:12:16 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
game.switchToNextPlayer();
|
2021-12-10 09:12:16 +01:00
|
|
|
}
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-12-10 19:48:17 +01:00
|
|
|
* Tests if the method throwDice halves the resources of the player
|
|
|
|
* 7 will be passed to the throwDice Method when called
|
|
|
|
*
|
|
|
|
* Method does not halve a resource, when the amount is below 7.
|
|
|
|
* Player has gotten 8 wool resources and throws a 7 with the dice
|
2021-12-09 16:14:47 +01:00
|
|
|
*
|
2021-12-10 19:48:17 +01:00
|
|
|
* expected: throwDice with a 7 will halve wool resource, the amount should be 4
|
2021-12-09 16:14:47 +01:00
|
|
|
*/
|
|
|
|
@Test
|
2021-12-10 19:48:17 +01:00
|
|
|
@DisplayName("Test Throw Dice with value 7, expected half the resources")
|
|
|
|
public void TestThrowDiceWith7() {
|
|
|
|
SiedlerGame game = gameAfterSetupPhase();
|
|
|
|
|
|
|
|
throwDiceSeveralTimes(game, 8, 1);
|
|
|
|
|
|
|
|
throwDiceSeveralTimes(game, 7, 1);
|
|
|
|
Assertions.assertEquals(2, game.getCurrentPlayerResource().get(Config.Resource.WOOL));
|
|
|
|
|
|
|
|
throwDiceSeveralTimes(game, 8, 1);
|
|
|
|
throwDiceSeveralTimes(game, 8, 1);
|
|
|
|
throwDiceSeveralTimes(game, 8, 1);
|
|
|
|
|
|
|
|
Assertions.assertEquals(8, game.getCurrentPlayerResource().get(Config.Resource.WOOL));
|
|
|
|
|
|
|
|
throwDiceSeveralTimes(game, 7, 1);
|
|
|
|
Assertions.assertEquals(4, game.getCurrentPlayerResource().get(Config.Resource.WOOL));
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
2021-12-08 14:39:19 +01:00
|
|
|
}
|
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
2021-12-10 11:45:57 +01:00
|
|
|
* @Class NegAtiveTestcases
|
2021-12-10 11:02:34 +01:00
|
|
|
*
|
2021-12-10 11:45:57 +01:00
|
|
|
* contains all negative test cases
|
2021-12-10 11:02:34 +01:00
|
|
|
*/
|
2021-12-09 16:14:47 +01:00
|
|
|
@Nested
|
|
|
|
@DisplayName("Negative test cases")
|
|
|
|
class NegativeTestcases {
|
2021-12-10 11:02:34 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Tests if siedlergame will start with one or five players.
|
|
|
|
* 1 Player is below the minimum
|
|
|
|
* 5 Players are above the maximum
|
|
|
|
*/
|
|
|
|
@ParameterizedTest(name = "Test with {arguments} players")
|
|
|
|
@ValueSource(ints = {1, 5})
|
|
|
|
@DisplayName("Starting Siedler game with one player or 5 players, expects fail")
|
|
|
|
public void startSiedlerGameWithOnePlayerorMoreThanMaximum(int playerAmount) {
|
|
|
|
Exception exc = assertThrows(IllegalArgumentException.class, () -> {
|
|
|
|
new SiedlerGame(DEFAULT_WINPOINTS, playerAmount);
|
|
|
|
});
|
|
|
|
|
|
|
|
Assertions.assertEquals(IllegalArgumentException.class, exc.getClass());
|
|
|
|
}
|
|
|
|
|
2021-12-09 16:14:47 +01:00
|
|
|
/**
|
2021-12-10 11:02:34 +01:00
|
|
|
* Tests if the game crashes when passing an amount of points, that is below the minimum amount
|
2021-12-09 16:14:47 +01:00
|
|
|
*/
|
|
|
|
@Test
|
2021-12-10 11:02:34 +01:00
|
|
|
@DisplayName("Starting Siedler game with one player, expects fail")
|
|
|
|
public void startSiedlerGameWithLowerThanMinimumWinPoints() {
|
2021-12-09 16:14:47 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
Exception exc = assertThrows(IllegalArgumentException.class, () -> {
|
|
|
|
SiedlerGame game = new SiedlerGame(1, 4);
|
|
|
|
});
|
2021-12-09 16:14:47 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
Assertions.assertEquals(IllegalArgumentException.class, exc.getClass());
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
|
2021-12-09 16:14:47 +01:00
|
|
|
/**
|
2021-12-10 11:02:34 +01:00
|
|
|
* This testcase will test, if the methods placeInitialRoad and placeInitialSettlement are overwritting
|
|
|
|
* already occupied positions if the same faction or any other faction are calling the method with the same positions
|
|
|
|
*
|
|
|
|
* Expected: Method placeInitialRoad placeInitialSettlement should return false, independent of the current faction playing
|
2021-12-09 16:14:47 +01:00
|
|
|
*/
|
|
|
|
@Test
|
2021-12-10 11:02:34 +01:00
|
|
|
@DisplayName("Test placeInitialRoad and placeInitialSettlement with already occupied positions")
|
|
|
|
public void testPlaceInitialStructuresInAlreadyOccupiedPositions() {
|
|
|
|
SiedlerGame game = startGame();
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
Point settlementPoint = START_SETTLEMENT_POSITIONS.get(Config.Faction.BLUE).get(1);
|
|
|
|
|
|
|
|
Assertions.assertTrue(game.placeInitialSettlement(settlementPoint, false));
|
|
|
|
Assertions.assertFalse(game.placeInitialSettlement(settlementPoint, false));
|
|
|
|
|
|
|
|
Tuple<Point, Point> roadEndpoints = START_ROADS_POSITIONS.get(Config.Faction.BLUE).get(1);
|
|
|
|
|
|
|
|
Assertions.assertTrue(game.placeInitialRoad(roadEndpoints.first, roadEndpoints.second));
|
|
|
|
Assertions.assertFalse(game.placeInitialRoad(roadEndpoints.first, roadEndpoints.second));
|
|
|
|
|
|
|
|
// Switch to other player to see if the occupied fields can be overwritten, when switched to the next player/faction
|
|
|
|
game.switchToNextPlayer();
|
|
|
|
|
|
|
|
Assertions.assertFalse(game.placeInitialRoad(roadEndpoints.first, roadEndpoints.second));
|
|
|
|
Assertions.assertFalse(game.placeInitialSettlement(settlementPoint, false));
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
2021-12-08 14:39:19 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-12-09 16:14:47 +01:00
|
|
|
* @Class SystemTestCases
|
|
|
|
*
|
|
|
|
* This class simulates a running game and tests multiple sequences of this game.
|
2021-12-08 14:39:19 +01:00
|
|
|
*/
|
2021-12-09 16:14:47 +01:00
|
|
|
@Nested
|
|
|
|
@DisplayName("System test cases")
|
|
|
|
class SystemTestcases {
|
|
|
|
|
|
|
|
/**
|
2021-12-10 11:45:57 +01:00
|
|
|
* TestS if the players can place initial settlements and roads
|
2021-12-09 16:14:47 +01:00
|
|
|
*/
|
|
|
|
@Test
|
2021-12-10 11:02:34 +01:00
|
|
|
@DisplayName("2 Players initialize a settlement and position")
|
|
|
|
public void TestGameInSetupPhase() {
|
2021-12-09 16:14:47 +01:00
|
|
|
SiedlerGame game = startGame();
|
2021-12-05 13:53:36 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
Assertions.assertTrue(game.placeInitialSettlement(START_SETTLEMENT_POSITIONS.get(game.getCurrentPlayerFaction()).get(0), false));
|
|
|
|
Tuple<Point, Point> road1 = START_ROADS_POSITIONS.get(game.getCurrentPlayerFaction()).get(0);
|
|
|
|
Assertions.assertTrue(game.placeInitialRoad(road1.first, road1.second));
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
game.switchToNextPlayer();
|
|
|
|
|
|
|
|
Assertions.assertTrue(game.placeInitialSettlement(START_SETTLEMENT_POSITIONS.get(game.getCurrentPlayerFaction()).get(1), false));
|
|
|
|
Tuple<Point, Point> road2 = START_ROADS_POSITIONS.get(game.getCurrentPlayerFaction()).get(1);
|
|
|
|
Assertions.assertTrue(game.placeInitialRoad(road2.first, road2.second));
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-12-10 11:02:34 +01:00
|
|
|
* tests, if the players can do all pf the actions in the building phase
|
2021-12-09 16:14:47 +01:00
|
|
|
*/
|
|
|
|
@Test
|
2021-12-10 11:02:34 +01:00
|
|
|
public void TestGameAfterSetupPhase() {
|
|
|
|
SiedlerGame game = gameAfterSetupPhase();
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 19:30:44 +01:00
|
|
|
throwDiceSeveralTimes(game, 8, 1);
|
2021-12-10 19:48:17 +01:00
|
|
|
Assertions.assertEquals(2, game.getCurrentPlayerResourceStock(Config.Resource.WOOL));
|
2021-12-10 11:45:57 +01:00
|
|
|
|
2021-12-08 14:39:19 +01:00
|
|
|
}
|
|
|
|
|
2021-12-10 19:30:44 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
}
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
|
|
|
* Initializes a game with the default values of winning points and amount of player
|
|
|
|
*
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
private static SiedlerGame startGame() {
|
|
|
|
return new SiedlerGame(DEFAULT_WINPOINTS, DEFAULT_PLAYERAMOUNT);
|
|
|
|
}
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
/**
|
|
|
|
* This method will set the game to the timeline after the setup.
|
|
|
|
* Players have already set each 2 Settlements and 2 Roads.
|
|
|
|
*
|
|
|
|
* @return SiedlerGame The game after the setup phase
|
|
|
|
*/
|
|
|
|
private static SiedlerGame gameAfterSetupPhase() {
|
|
|
|
SiedlerGame game = startGame();
|
2021-12-08 15:01:33 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
for (int i = 0; i < game.getPlayerFactions().size(); i++) {
|
|
|
|
Config.Faction f = game.getCurrentPlayerFaction();
|
2021-12-08 14:39:19 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
game.placeInitialSettlement(START_SETTLEMENT_POSITIONS.get(f).get(0), false);
|
|
|
|
Tuple<Point, Point> firstRoad = START_ROADS_POSITIONS.get(f).get(0);
|
|
|
|
game.placeInitialRoad(firstRoad.first, firstRoad.second);
|
2021-12-09 16:14:47 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
game.switchToNextPlayer();
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
2021-12-10 11:02:34 +01:00
|
|
|
for (int i = 0; i < game.getPlayerFactions().size(); i++) {
|
|
|
|
game.switchToPreviousPlayer();
|
|
|
|
Config.Faction f = game.getCurrentPlayerFaction();
|
2021-12-09 16:14:47 +01:00
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
game.placeInitialSettlement(START_SETTLEMENT_POSITIONS.get(f).get(1), false);
|
|
|
|
Tuple<Point, Point> secondRoad = START_ROADS_POSITIONS.get(f).get(1);
|
|
|
|
game.placeInitialRoad(secondRoad.first, secondRoad.second);
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
|
|
|
|
2021-12-10 11:02:34 +01:00
|
|
|
return game;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This method will call the method "throwDice" multiple times and passes the set value of the dice
|
|
|
|
*
|
|
|
|
* @param game Type SiedlerGame, the game itself in a running state
|
|
|
|
* @param dice Type int, Set Value of dice
|
|
|
|
* @param amountDiceThrows Type int, The amount of dice throws
|
|
|
|
*/
|
|
|
|
private static void throwDiceSeveralTimes(SiedlerGame game, int dice, int amountDiceThrows) {
|
|
|
|
for (int i = 0; i < amountDiceThrows; i++) {
|
|
|
|
game.throwDice(dice);
|
2021-12-09 16:14:47 +01:00
|
|
|
}
|
2021-12-10 11:02:34 +01:00
|
|
|
}
|
2021-12-09 16:14:47 +01:00
|
|
|
|
2021-11-19 08:32:32 +01:00
|
|
|
}
|