| 4 | 4 | // |
| 5 | 5 | |
| 6 | 6 | /** |
| 7 | | * @param {string[]} board |
| 8 | | * @returns {string} |
| 7 | * Determines the state of a Tic-Tac-Toe game based on the given board. |
| 8 | * |
| 9 | * @param {string[]} board - An array of 3 strings representing the rows of the board. |
| 10 | * Each string contains 3 characters: 'X', 'O', or ' ' (empty). |
| 11 | * @returns {string} - Returns 'win', 'draw', or 'ongoing' based on the game state. |
| 12 | * @throws {Error} - Throws an error for invalid board states with specific messages. |
| 9 | 13 | */ |
| 10 | 14 | export const gamestate = (board) => { |
| 11 | | throw new Error('Remove this line and implement the function'); |
| 12 | | }; |
| 15 | // Validate board structure |
| 16 | if (!Array.isArray(board) || board.length !== 3) { |
| 17 | throw new Error('Invalid board: must have 3 rows'); |
| 18 | } |
| 19 | |
| 20 | for (let i = 0; i < 3; i++) { |
| 21 | if (typeof board[i] !== 'string' || board[i].length !== 3) { |
| 22 | throw new Error('Invalid board: each row must be a string of length 3'); |
| 23 | } |
| 24 | } |
| 25 | |
| 26 | // Count Xs and Os |
| 27 | let countX = 0; |
| 28 | let countO = 0; |
| 29 | |
| 30 | for (let i = 0; i < 3; i++) { |
| 31 | for (let j = 0; j < 3; j++) { |
| 32 | const cell = board[i][j]; |
| 33 | if (cell === 'X') { |
| 34 | countX++; |
| 35 | } else if (cell === 'O') { |
| 36 | countO++; |
| 37 | } else if (cell !== ' ') { |
| 38 | throw new Error('Invalid board: cells can only contain X, O, or space'); |
| 39 | } |
| 40 | } |
| 41 | } |
| 42 | |
| 43 | // Edge Case: Wrong turn order validation |
| 44 | if (countO > countX) { |
| 45 | if (countO > countX + 1) { |
| 46 | throw new Error('Wrong turn order: O went twice'); |
| 47 | } else if (countX === 0) { |
| 48 | throw new Error('Wrong turn order: O started'); |
| 49 | } |
| 50 | // If countO === countX + 1 and countX > 0, this is valid (O just made the last move) |
| 51 | } |
| 52 | |
| 53 | if (countX > countO + 1) { |
| 54 | throw new Error('Wrong turn order: X went twice'); |
| 55 | } |
| 56 | |
| 57 | // Check for wins |
| 58 | const winPatterns = [ |
| 59 | // Rows |
| 60 | [[0,0], [0,1], [0,2]], |
| 61 | [[1,0], [1,1], [1,2]], |
| 62 | [[2,0], [2,1], [2,2]], |
| 63 | // Columns |
| 64 | [[0,0], [1,0], [2,0]], |
| 65 | [[0,1], [1,1], [2,1]], |
| 66 | [[0,2], [1,2], [2,2]], |
| 67 | // Diagonals |
| 68 | [[0,0], [1,1], [2,2]], |
| 69 | [[0,2], [1,1], [2,0]] |
| 70 | ]; |
| 71 | |
| 72 | let xWins = false; |
| 73 | let oWins = false; |
| 74 | |
| 75 | for (const pattern of winPatterns) { |
| 76 | const [a, b, c] = pattern; |
| 77 | const valA = board[a[0]][a[1]]; |
| 78 | const valB = board[b[0]][b[1]]; |
| 79 | const valC = board[c[0]][c[1]]; |
| 80 | |
| 81 | if (valA !== ' ' && valA === valB && valB === valC) { |
| 82 | if (valA === 'X') { |
| 83 | xWins = true; |
| 84 | } else if (valA === 'O') { |
| 85 | oWins = true; |
| 86 | } |
| 87 | |
| 88 | // If we found a win, we can stop checking other patterns |
| 89 | // since we only need to know if each player has at least one win |
| 90 | if (xWins && oWins) { |
| 91 | break; |
| 92 | } |
| 93 | } |
| 94 | } |
| 95 | |
| 96 | // Edge Case: Both players win (impossible in a valid game) |
| 97 | if (xWins && oWins) { |
| 98 | throw new Error('Impossible board: game should have ended after the game was won'); |
| 99 | } |
| 100 | |
| 101 | // Edge Case: Game continued after win |
| 102 | // If X wins, X should have either the same count as O (X just won) or one more (X had already won) |
| 103 | // If O wins, O should have the same count as X (O just won) |
| 104 | if (xWins && countO > countX) { |
| 105 | throw new Error('Impossible board: game should have ended after the game was won'); |
| 106 | } |
| 107 | |
| 108 | if (oWins && countX > countO) { |
| 109 | throw new Error('Impossible board: game should have ended after the game was won'); |
| 110 | } |
| 111 | |
| 112 | // Determine game state |
| 113 | if (xWins || oWins) { |
| 114 | return 'win'; |
| 115 | } |
| 116 | |
| 117 | // Edge Case: Draw - board is full with no winner |
| 118 | if (countX + countO === 9) { |
| 119 | return 'draw'; |
| 120 | } |
| 121 | |
| 122 | // Edge Case: Ongoing game - board is not full and no winner |
| 123 | return 'ongoing'; |
| 124 | |
| 125 | // Handled Edge Cases: |
| 126 | // 1. Wrong turn order - O started |
| 127 | // 2. Wrong turn order - X went twice in a row |
| 128 | // 3. Both players win (impossible in a valid game) |
| 129 | // 4. Game continued after X win |
| 130 | // 5. Game continued after O win |
| 131 | // 6. Draw - board is full with no winner |
| 132 | // 7. Ongoing game - board is not full and no winner |
| 133 | // 8. Invalid board structure |
| 134 | // 9. Invalid characters on board |
| 135 | }; |