Implement Generalized Tic-Tac-Toe

Generalized Tic-Tac-Toe

Design a generalized Tic-Tac-Toe game played by two players on an m x n grid. The game is won when a player places k or more consecutive marks horizontally, vertically, or diagonally.

Implement the TicTacToe class:

• TicTacToe(m: int, n: int, k: int): Initializes the board with m rows, n columns, and a target streak length of k.
• move(row: int, col: int, player: int) -> int: Places a mark on the board at (row, col) for player player (where player is either 1 or 2).
  • Returns 0 if no player has won after this move.
  • Returns 1 if Player 1 wins after this move.
  • Returns 2 if Player 2 wins after this move.
  • Once a player has won, no more moves are made (or you may assume all subsequent calls are invalid).

Rules and Clarifications

• A line of length greater than or equal to k consecutive marks of the same player constitutes a win.
• You only need to check lines passing through the cell (row, col) of the current move.
• Diagonal checks must account for both main diagonals (\) and anti-diagonals (/), which may have lengths shorter or longer than k depending on the board dimensions and cell location.
• Assume all inputs given to move are within bounds and played on an empty cell.

Example

game = TicTacToe(3, 4, 3)

# Board is 3 rows, 4 cols. Need 3 consecutive marks to win.
game.move(0, 0, 1)  # returns 0
game.move(1, 0, 2)  # returns 0
game.move(0, 1, 1)  # returns 0
game.move(1, 1, 2)  # returns 0
game.move(0, 2, 1)  # returns 1 (Player 1 has 3 marks in row 0: (0,0), (0,1), (0,2))

Constraints

• 1 <= m, n <= 10^4
• m * n <= 10^6
• 1 <= k <= max(m, n)
• player in (1, 2)
• At most m * n calls will be made to move.
• Each move call takes a distinct, previously unoccupied (row, col).