Problem

Ask

Submissions

Home

Courses

Course Homepage

Problem: Design Tic-Tac-Toe

Medium

30 min

Explore how to implement a Tic-Tac-Toe game class that efficiently tracks player moves on an n by n board. Learn to manage valid moves, detect winning conditions, and return game outcomes dynamically. Understand key concepts behind game state tracking applicable to coding interviews and system design problems.

Statement

Suppose that two players are playing a tic-tac-toe game on an $n \times n$ board. They’re following specific rules to play and win the game:

A move is guaranteed to be valid if a mark is placed on an empty block.
No more moves are allowed once a winning condition is reached.
A player who succeeds in placing $n$ of their marks in a horizontal, vertical, or diagonal row wins the game.

Implement a TicTacToe class, which will be used by two players to play the game and win fairly.

Keep in mind the following functionalities that need to be implemented:

Constructor, the constructor, which initializes an object of TicTacToe, allowing the players to play on a board of size $n \times n$ .
move(row, col, player) indicates that the player with the ID, player, places their mark on the cell (row, col). The move is guaranteed to be a valid move. At each move, this function returns the player ID if the current player wins and returns $0$ if no one wins.

Constraints:

$2 \leq n \leq 9$
player should be either 1 or 2.
$0 \leq$ row, col $< n$
Every call to move() will be with a unique row, col combination.
The move() function will be called at most $n^2$ times.

Design Tic-Tac-Toe

We are given the current state of a game on a $3 \times 3$ board, showing the moves made so far, where Player 1’s moves are denoted by a cross, and Player 2’s moves are denoted by a circle.

The following moves are now made by the players:

move(0, 2, 2)
move(1, 0, 1)

What would the result be?

Player 1 wins the game.

Player 2 wins the game.

No one wins the game.

1 / 3

Problem: Design Tic-Tac-Toe

Medium

30 min

Statement

Suppose that two players are playing a tic-tac-toe game on an $n \times n$ board. They’re following specific rules to play and win the game:

A move is guaranteed to be valid if a mark is placed on an empty block.
No more moves are allowed once a winning condition is reached.
A player who succeeds in placing $n$ of their marks in a horizontal, vertical, or diagonal row wins the game.

Implement a TicTacToe class, which will be used by two players to play the game and win fairly.

Keep in mind the following functionalities that need to be implemented:

Constructor, the constructor, which initializes an object of TicTacToe, allowing the players to play on a board of size $n \times n$ .
move(row, col, player) indicates that the player with the ID, player, places their mark on the cell (row, col). The move is guaranteed to be a valid move. At each move, this function returns the player ID if the current player wins and returns $0$ if no one wins.

Constraints:

$2 \leq n \leq 9$
player should be either 1 or 2.
$0 \leq$ row, col $< n$
Every call to move() will be with a unique row, col combination.
The move() function will be called at most $n^2$ times.

Design Tic-Tac-Toe

We are given the current state of a game on a $3 \times 3$ board, showing the moves made so far, where Player 1’s moves are denoted by a cross, and Player 2’s moves are denoted by a circle.

The following moves are now made by the players:

move(0, 2, 2)
move(1, 0, 1)

What would the result be?

Player 1 wins the game.

Player 2 wins the game.

No one wins the game.

1 / 3

Problem: Design Tic-Tac-Toe

Statement

Examples

Understanding the problem

Figure it out!

Try it yourself

Problem: Design Tic-Tac-Toe

Statement

Examples

Understanding the problem

Figure it out!

Try it yourself