Snake Game operates on a grid—a two-dimensional matrix made up of rows and columns. Each cell in this grid represents a possible position for the snake or food.

Instead of using continuous coordinates like in physics-based games, Snake Game relies on discrete steps. The snake moves from one cell to another in fixed intervals. This simplifies calculations and makes the game predictable and efficient.

For example, you can represent the grid as:

• A 2D array (for rendering and collision checks), or
• A coordinate system where each segment of the snake is stored as an (x, y) pair

This discrete structure is what allows the snake to move in clean, right-angled directions without partial positions.