## Problem Implement the core logic for a two-player turn-based game on a 3x3 grid (like Tic-Tac-Toe generalized to N x N). ```python class MiniGame: def __init__(self, n: int): # n x n board, players are 1 and 2 pass def make_move(self, player: int, row: int, col: int) -> str: # returns "continue", "win", "draw", or "invalid" pass def get_board(self) -> list[list[int]]: pass ``` **Example:** ``` game = MiniGame(3) game.make_move(1, 0, 0) -> "continue" game.make_move(2, 1, 1) -> "continue" game.make_move(1, 0, 1) -> "continue" game.make_move(2, 2, 0) -> "continue" game.make_move(1, 0, 2) -> "win" (player 1 fills row 0) ``` ## Follow-ups 1. How do you check for a win in O(1) per move using running row/column/diagonal counts? 2. How would you implement an AI opponent using minimax with alpha-beta pruning? 3. Extend to a 4-in-a-row (Connect Four) variant on a 6x7 grid with gravity. What changes? 4. How would you serialize and restore game state so players can pause and resume?

InterviewDB Experience

Mini Game: Implement Turn-Based Game Logic with Win Detection

Interview Experience

Problem Implement the core logic for a two-player turn-based game on a 3x3 grid (like Tic-Tac-Toe generalized to N x N). Example: Follow-ups How do you check for a win in O(1) per move using running row/column/diagonal counts? How would you implement an AI opponent using minimax with alpha-beta pruning? Extend to a 4-in-a-row (Connect Four) variant on a 6x7 grid with gravity. What changes? How would you serialize and restore game state so players can pause and resume?

Full Details

🔒

Unlock all Karat questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a candidate experience report from a karat interview.

It covers the following topics: Coding, Matrix .

Topics

Coding Matrix

Mini Game: Implement Turn-Based Game Logic with Win Detection

Interview Experience

Full Details

About This Question

Topics

More Karat Interview Questions