board->moves = 0;
}
+dvonn_bool_t
+dvonn_board_cell_occupied (dvonn_board_t *board,
+ int x, int y)
+{
+ if (x < 0 || x >= DVONN_BOARD_X_SIZE ||
+ y < 0 || y >= DVONN_BOARD_Y_SIZE)
+ {
+ return FALSE;
+ }
+
+ if (board->cells[x][y].type == DVONN_CELL_INVALID ||
+ board->cells[x][y].type == DVONN_CELL_EMPTY)
+ {
+ return FALSE;
+ }
+
+ return TRUE;
+}
+
+dvonn_bool_t
+dvonn_board_cell_surrounded (dvonn_board_t *board,
+ int x, int y)
+{
+ int surround_count;
+
+ surround_count =
+ dvonn_board_cell_occupied (board, x - 1, y) +
+ dvonn_board_cell_occupied (board, x + 1, y) +
+ dvonn_board_cell_occupied (board, x, y - 1) +
+ dvonn_board_cell_occupied (board, x, y + 1) +
+ dvonn_board_cell_occupied (board, x + 1, y - 1) +
+ dvonn_board_cell_occupied (board, x - 1, y + 1);
+
+ return (surround_count == 6);
+}
+
static dvonn_bool_t
dvonn_board_move_legal (dvonn_board_t *board,
int x1, int y1,
int x2, int y2,
char **error)
{
+ int distance;
+
if (x1 < 0 || x1 >= DVONN_BOARD_X_SIZE ||
y1 < 0 || y1 >= DVONN_BOARD_Y_SIZE ||
x2 < 0 || x2 >= DVONN_BOARD_X_SIZE ||
return FALSE;
}
- if (board->cells[x1][y1].type == DVONN_CELL_INVALID) {
+ if (board->cells[x1][y1].type == DVONN_CELL_INVALID ||
+ board->cells[x2][y2].type == DVONN_CELL_INVALID)
+ {
*error = "Not a valid board space";
return FALSE;
}
if (board->cells[x1][y1].type == DVONN_CELL_EMPTY) {
- *error = "There is no piece there to move";
+ *error = "There are no pieces there to move";
+ return FALSE;
+ }
+
+ if (dvonn_board_cell_surrounded (board, x1, y1)) {
+ *error = "You cannot move a piece that is surrounded";
return FALSE;
}
if (board->cells[x1][y1].type != board->player) {
- *error = "You cannot move your opponent's piece";
+ *error = "You cannot move your opponent's stack";
+ return FALSE;
+ }
+
+ if (board->cells[x2][y2].type == DVONN_CELL_EMPTY) {
+ *error = "You cannot move to an empty space";
+ return FALSE;
+ }
+
+ /* Move must be in a straight line, which in our array is
+ * horizontal, vertical, or one of the diagonals. */
+ if (x2 == x1)
+ distance = abs (y2 - y1);
+ else if (y2 == y1)
+ distance = abs (x2 - x1);
+ else if ((x2 - x1) == - (y2 - y1))
+ distance = abs (x2 - x1);
+ else {
+ *error = "Move is not in a straight line";
return FALSE;
}
- /* XXX: Need to code up DVONN-legal move calculation here. */
+ if (distance != board->cells[x1][y1].height) {
+ *error = "Move distance is not the same as stack height";
+ return FALSE;
+ }
return TRUE;
}
board->player = DVONN_PLAYER_BLACK;
}
+int
+dvonn_board_pass (dvonn_board_t *board)
+{
+ /* XXX: Should check here and only allow a pass if there are
+ * no legal moves. */
+
+ dvonn_board_next_player (board);
+
+ return TRUE;
+}
+
int
dvonn_board_place (dvonn_board_t *board,
int x, int y,
return TRUE;
}
+static void
+fill_living(dvonn_board_t *board,
+ int living[DVONN_BOARD_X_SIZE][DVONN_BOARD_Y_SIZE],
+ int x, int y)
+{
+ if (dvonn_board_cell_occupied (board, x, y) && ! living[x][y])
+ {
+ living[x][y] = 1;
+
+ fill_living (board, living, x - 1, y);
+ fill_living (board, living, x + 1, y);
+ fill_living (board, living, x, y - 1);
+ fill_living (board, living, x, y + 1);
+ fill_living (board, living, x + 1, y - 1);
+ fill_living (board, living, x - 1, y + 1);
+ }
+}
+
+static void
+eliminate_disconnected_stacks (dvonn_board_t *board)
+{
+ int x, y;
+ int living[DVONN_BOARD_X_SIZE][DVONN_BOARD_Y_SIZE];
+
+ for (x = 0; x < DVONN_BOARD_X_SIZE; x++)
+ for (y = 0; y < DVONN_BOARD_Y_SIZE; y++)
+ living[x][y] = 0;
+
+ for (x = 0; x < DVONN_BOARD_X_SIZE; x++)
+ for (y = 0; y < DVONN_BOARD_Y_SIZE; y++)
+ if (board->cells[x][y].contains_red)
+ fill_living (board, living, x, y);
+
+ for (x = 0; x < DVONN_BOARD_X_SIZE; x++)
+ for (y = 0; y < DVONN_BOARD_Y_SIZE; y++)
+ if (dvonn_board_cell_occupied (board, x, y) &&
+ ! living[x][y])
+ {
+ board->cells[x][y].type = DVONN_CELL_EMPTY;
+ board->cells[x][y].height = 0;
+ }
+}
+
int
dvonn_board_move (dvonn_board_t *board,
int x1, int y1,
board->cells[x1][y1].height = 0;
board->cells[x1][y1].contains_red = FALSE;
+ eliminate_disconnected_stacks (board);
+
dvonn_board_next_player (board);
return TRUE;