From 82991e96e76cc0c163a7a398a98e777a9c7e07f3 Mon Sep 17 00:00:00 2001
From: Cameron Blankenbuehler <cameron.blankenbuehler@protonmail.com>
Date: Mon, 27 Mar 2023 16:32:11 -0400
Subject: [PATCH] Add BoardCell struct

---
 src/boggler/c/board.h   | 101 ++++++++++++++++++++++++++++++++++++----
 src/boggler/c/boggler.c |  11 +++--
 2 files changed, 98 insertions(+), 14 deletions(-)

diff --git a/src/boggler/c/board.h b/src/boggler/c/board.h
index 29be65f..9327aa8 100644
--- a/src/boggler/c/board.h
+++ b/src/boggler/c/board.h
@@ -6,28 +6,81 @@
 #include <stdlib.h>
 #include <string.h>
 
+/* Board is structured like so when referencing cells
+ *      x ->
+ *    +---+---+---+---+
+ *  y |0,0|1,0|2,0|3,0| -+
+ *  | |---------------|  |
+ *  v |0,1|1,1|2,1|3,1|  |
+ *    |---------------|  | height
+ *    |0,2|1,2|2,2|3,2|  |
+ *    |---------------|  |
+ *    |0,3|1,3|2,3|3,3| -+
+ *    +---+---+---+---+
+ *     |             |
+ *     +-------------+
+ *          width
+ *
+ *    Vec2 = (x, y) = (col, row)
+ */
+
+struct BoardCell {
+    char *letters;
+    uint8_t row;
+    uint8_t col;
+    struct BoardCell **adjacent_cells;
+    uint8_t adjacent_cnt;
+};
+
+typedef struct Vec2 {
+    uint8_t row;
+    uint8_t col;
+} Vec2;
+
 typedef struct Board {
+    /* BoardCells are indexed from top-to-bottom, left-to-right
+     * For instance a 3x3 board would have cells ordered like this
+     * +---+---+---+
+     * | 0 | 1 | 2 |
+     * |---+---+---|
+     * | 3 | 4 | 5 |
+     * |---+---+---|
+     * | 6 | 7 | 8 |
+     * +---+---+---+
+     */
     uint8_t height;
     unsigned short width;
-    char **cells;
+    struct BoardCell **cells;
 } Board;
 
-char *get_cell_at(Board *board, uint8_t row, uint8_t col) {
-    return board->cells[row * col + col];
+struct BoardCell *create_board_cell(char *letters, uint8_t row, uint8_t col) {
+    /* BoardCells are created with 8 adjacent cells since that is the minimum required
+     * for centrally placed (not on sides or corners) cells on a board.
+     */
+    struct BoardCell *cell = malloc(sizeof(struct BoardCell*));
+    cell->letters = letters;
+    cell->row = row;
+    cell->col = col;
+
+    return cell;
 }
 
-int print_board(Board board) {
-    char *row_delim = malloc((board.width * 4 + 1) * sizeof(char));
+struct BoardCell *get_cell_at(Board *board, Vec2 pos) {
+    return board->cells[pos.row * pos.col + pos.col];
+}
+
+int print_board(Board *board) {
+    char *row_delim = malloc((board->width * 4 + 1) * sizeof(char));
     row_delim[0] = '+';
-    for (uint8_t i = 0; i < board.width; i++) {
+    for (uint8_t i = 0; i < board->width; i++) {
         strcat(row_delim, "----");
     }
     row_delim[strlen(row_delim)-1] = '+';
 
-    for (uint8_t row = 0; row < board.height; row++) {
+    for (uint8_t row = 0; row < board->height; row++) {
         printf("%s\n", row_delim);
-        for (uint8_t col = 0; col < board.width; col++) {
-            printf("|%2s ", board.cells[(row * board.width) + col]);
+        for (uint8_t col = 0; col < board->width; col++) {
+            printf("|%2s ", board->cells[(row * board->width) + col]->letters);
         }
         puts("|");
     }
@@ -38,4 +91,34 @@ int print_board(Board board) {
     return 0;
 }
 
+//Vec2[] get_adjacent_indexes(uint8_t board_size, Vec2 pos) {
+//    // Calculate total possible number of adjacent cells 
+//    uint16_t = total_adj_cell_cnt = ((board-size-2) * (board-size-2) * 8) + ((board-size-2) * 4 * 5) + (4 * 3);
+//
+//    Vec2[] indexes = malloc(8 * sizeof(Vec2));
+//    uint16_t i = 0;
+//    if (pos.row > 0) {
+//        indexes[i].append((row-1, col)) // up
+//        if col > 0:
+//            indexes.append((row-1, col-1)) // up-left
+//        if col < self.width - 1:
+//            indexes.append((row-1, col+1)) // up-right
+//    }
+//    if row < self.height - 1:
+//        indexes.append((row+1, col)) // down
+//        if col > 0:
+//            indexes.append((row+1, col-1)) // down-left
+//        if col < self.width - 1:
+//            indexes.append((row+1, col+1)) // down-right
+//    if col > 0:
+//        indexes.append((row, col-1)) // left
+//    if col < self.width - 1:
+//        indexes.append((row, col+1)) // right
+//
+//    if (i != 8) {
+//        indexes = realloc(i * sizeof(Vec2));
+//    }
+//    return indexes
+//}
+
 #endif
diff --git a/src/boggler/c/boggler.c b/src/boggler/c/boggler.c
index 30eaece..f0d3b2e 100644
--- a/src/boggler/c/boggler.c
+++ b/src/boggler/c/boggler.c
@@ -12,13 +12,14 @@ int main(int argc, char **argv) {
         "i", "s", "h", "a",
         "s", "e", "l", "b"
     };
-    char **cell_letters = malloc(BOARD_SIZE * sizeof(char*));
+    char **cell_letters = malloc(BOARD_SIZE * sizeof(struct BoardCell*));
+
+    struct BoardCell **cells = malloc(sizeof(struct BoardCell*) * BOARD_SIZE * BOARD_SIZE);
     for (uint8_t i = 0; i < BOARD_SIZE * BOARD_SIZE; i++) {
-        cell_letters[i] = malloc(strlen(letters[i]) * sizeof(char));
-        cell_letters[i] = letters[i];
+        cells[i] = create_board_cell(letters[i], (int)(i / BOARD_SIZE), i % BOARD_SIZE);
     }
 
-    Board board = { .height = 4, .width = 4, .cells = cell_letters };
-    print_board(board);
+    Board board = { .height = 4, .width = 4, .cells = cells };
+    print_board(&board);
     free(cell_letters);
 }