TicTacToe Move Handling | Dataford Interview Questions

Scribd's mobile reading experience may need lightweight game-state logic for interactive content. Given a legal sequence of Tic-Tac-Toe moves, determine whether player A won, player B won, the game is a draw, or play is still pending.

Players alternate turns, with A moving first. The board has three rows and three columns. A player wins immediately after placing a mark in an entire row, column, or diagonal. The input sequence stops when the game ends or when all nine cells are filled.

Formal Specification

Implement tictactoe(moves), where moves is a list of coordinate pairs. The first pair belongs to A, the second to B, and so on. Return one of the strings "A", "B", "Draw", or "Pending".

Constraints

0 <= len(moves) <= 9
Each move is a coordinate pair [row, column]
0 <= row, column < 3
Moves are legal, alternate between A and B, and contain no repeated cell
The sequence stops immediately after a winning move

Function Signature

def tictactoe(moves):

Your question is TicTacToe Move Handling. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Constraints

0 <= len(moves) <= 9
Each move is a coordinate pair [row, column]
0 <= row, column < 3
Moves are legal, alternate between A and B, and contain no repeated cell
The sequence stops immediately after a winning move

Function Signature

def tictactoe(moves):

Your question is TicTacToe Move Handling. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.