day 4, part 2

jgbowser · Dec 7, 2021 · ae58315 · ae58315
1 parent 7a3f10f
commit ae58315
Showing 1 changed file with 58 additions and 16 deletions.
diff --git a/Day4/squidGame.js b/Day4/squidGame.js
@@ -30,23 +30,31 @@ function formatInputs(data) {
 
 const { numbers, boards } = formatInputs(data);
 
+// Part 1: find the first board that will win with the given input and calculate winning score
+
 function checkForBingo(board) {
   let isBingo = false;
 
   // first check each row for bingo
-  board.forEach(row => {
-    if (row.every(e => e === 0)) {
+  board.forEach((row) => {
+    if (row.every((e) => e === 0)) {
       isBingo = true;
     }
   });
 
   // if we don't have a bingo check the columns now
   for (let i = 0; i < 5; i++) {
-    const column = [board[0][i], board[1][i], board[2][i], board[3][i], board[4][i]]
-    if (column.every(e => e === 0)) {
-      isBingo = true
+    const column = [
+      board[0][i],
+      board[1][i],
+      board[2][i],
+      board[3][i],
+      board[4][i],
+    ];
+    if (column.every((e) => e === 0)) {
+      isBingo = true;
     }
-  };
+  }
 
   return isBingo;
 }
@@ -58,24 +66,24 @@ function getTurnsToWin(board, nums) {
   let isBingo = false;
 
   for (let i = 0; i < nums.length; i++) {
-    turns++
+    turns++;
     for (let j = 0; j < 5; j++) {
-      const index = boardCopy[j].findIndex(e => e === nums[i])
+      const index = boardCopy[j].findIndex((e) => e === nums[i]);
       if (index !== -1) {
-        boardCopy[j][index] = 0
+        boardCopy[j][index] = 0;
         break;
       }
     }
     if (i >= 5) {
       isBingo = checkForBingo(boardCopy);
     }
-    if(isBingo) {
+    if (isBingo) {
       lastDrawnNumber = nums[i];
       break;
     }
   }
 
-  return { boardCopy, turns, lastDrawnNumber};
+  return { boardCopy, turns, lastDrawnNumber };
 }
 
 function findFirstWinningBoard(nums, boards) {
@@ -86,9 +94,12 @@ function findFirstWinningBoard(nums, boards) {
   // loop through each board
   for (let i = 0; i < boards.length; i++) {
     // for each board determine how mny steps to win, set the boardIndex and turns required if < current turns required
-    const { turns, boardCopy, lastDrawnNumber } = getTurnsToWin(boards[i], nums)
+    const { turns, boardCopy, lastDrawnNumber } = getTurnsToWin(
+      boards[i],
+      nums
+    );
 
-    if(turns < currentLowestTurns) {
+    if (turns < currentLowestTurns) {
       currentLowestTurns = turns;
       bestBoard = boardCopy;
       finalNumber = lastDrawnNumber;
@@ -100,9 +111,40 @@ function findFirstWinningBoard(nums, boards) {
 
 function calculateScore(board, multiplier) {
   const flattenedBoard = board.flat();
-  return flattenedBoard.reduce((a, c) => a + c) * multiplier
+  return flattenedBoard.reduce((a, c) => a + c) * multiplier;
+}
+
+// make a copy to prevent the original from being modified and messing up part 2
+const boardsCopy = JSON.parse(JSON.stringify(boards));
+
+const { bestBoard, finalNumber } = findFirstWinningBoard(numbers, boardsCopy);
+console.log("Winning score: ", calculateScore(bestBoard, finalNumber));
+
+// Part 2: Pick the last board to win and calculate the score
+
+function findLastWinningBoard(nums, boards) {
+  let worstBoard;
+  let currentHighestTurns = 0;
+  let finalNum;
+
+  // loop through each board
+  for (let i = 0; i < boards.length; i++) {
+    // for each board determine how mny steps to win, set the boardIndex and turns required if < current turns required
+    const { turns, boardCopy, lastDrawnNumber } = getTurnsToWin(
+      boards[i],
+      nums
+    );
+
+    if (turns > currentHighestTurns) {
+      currentHighestTurns = turns;
+      worstBoard = boardCopy;
+      finalNum = lastDrawnNumber;
+    }
+  }
+
+  return { worstBoard, finalNum };
 }
 
-const { bestBoard, finalNumber } = findFirstWinningBoard(numbers, boards);
+const { worstBoard, finalNum } = findLastWinningBoard(numbers, boards);
 
-console.log("Winning score: ", calculateScore(bestBoard, finalNumber));
+console.log("Losing score: ", calculateScore(worstBoard, finalNum));