Move validation in LLD - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding move validation in a turn-based game

In a turn-based board game system, which component is primarily responsible for ensuring that a player's move is legal before updating the game state?

A The database persistence layer

B The user interface rendering component

C The network communication handler

D The game engine's move validator module

💡 Hint

Think about which part checks rules before changing the game state.

The move validator module checks if a move follows game rules before the game engine updates the state. UI and network handle display and communication, while the database stores data.

❓ Architecture

intermediate

Designing a scalable move validation system

You are designing a multiplayer online chess platform. Which architectural approach best supports scalable and consistent move validation across many concurrent games?

A Centralized move validation service with stateless validation logic and shared game state storage

B Each client validates moves independently without server verification

C Move validation embedded only in the database triggers

D Move validation done only on the client side with server accepting all moves

💡 Hint

Consider consistency and scalability for many players.

A centralized stateless validation service ensures consistent rules enforcement and scales by handling requests independently. Client-only validation risks cheating and inconsistency. Database triggers are inefficient for complex logic.

❓ scaling

advanced

Handling high load in move validation for real-time games

During peak hours, a real-time strategy game experiences thousands of move validation requests per second. Which strategy best improves system scalability without sacrificing validation accuracy?

A Store all moves in a single database table and validate moves synchronously on each insert

B Implement a distributed move validation system with sharded game state and asynchronous validation queues

C Increase client-side validation and trust clients to send only valid moves

D Disable move validation temporarily during peak load to reduce latency

💡 Hint

Think about distributing load and maintaining accuracy.

Distributed validation with sharded state and async queues balances load and keeps validation accurate. Client trust risks cheating. Single DB table causes bottlenecks. Disabling validation breaks game integrity.

❓ tradeoff

advanced

Tradeoffs between synchronous and asynchronous move validation

What is a key tradeoff when choosing asynchronous move validation over synchronous validation in a multiplayer game?

A Asynchronous validation improves responsiveness but may delay detecting invalid moves

B Asynchronous validation guarantees immediate rejection of invalid moves

C Synchronous validation reduces server load by batching moves

D Synchronous validation allows clients to skip server checks

💡 Hint

Consider timing and user experience impacts.

Asynchronous validation lets the game respond faster but invalid moves might be detected later, possibly requiring rollback. Synchronous validation checks moves immediately but can increase latency. Options B, C, and D are incorrect descriptions.

❓ estimation

expert

Estimating capacity for move validation service

A move validation service handles 10,000 concurrent games. Each game averages 2 moves per minute. Each move validation request takes 50ms CPU time on average. Estimate the minimum number of CPU cores needed to handle the load without queuing.

A Approximately 10 cores

B Approximately 7 cores

C Approximately 17 cores

D Approximately 20 cores

💡 Hint

Calculate total requests per second and CPU time per second, then divide by core capacity.

Requests per second = (10,000 games * 2 moves) / 60 = ~333.3 req/s. Total CPU time per second = 333.3 * 50ms = 16,665 ms = 16.665 seconds of CPU per second. Each core provides 1 second CPU per second, so cores needed = 16.665 ≈ 17 cores.