How does cube_round resolve floating point rounding errors?

It finds whichever of q, r, or s had the largest rounding difference and recalculates it from the other two to strictly preserve q + r + s = 0.

Updated: August 2026 • Verified v1.2

Hexagonal Grid Line-Drawing & Raycasting Simulator

Creative & DesignNew

Local Browser Execution: Your input is processed locally in your browser and is not sent to UTL servers.

N = distance(A, B); step = 1/N; point = cube_round(cube_lerp(A, B, step * i))

Was this calculation helpful?

Understanding Your Results

Interactively draws the shortest hex path between source and target, detects wall collisions, indicates clear vs blocked line of sight, and exports TypeScript code.

Practical Guidance & Next Steps

Adding an infinitesimal epsilon nudge (e.g. 1e-6) prevents ambiguous rounding along hex vertex and edge boundaries, ensuring deterministic symmetric lines.

What is this?

An interactive game development algorithm simulator for hexagonal grid line-drawing and line-of-sight raycasting.

How does it work?

1. Click on the grid to set Start Hex (A) and Target Hex (B). 2. Place wall obstacles on intermediate hex cells. 3. The simulator performs cube coordinate linear interpolation and determines whether line-of-sight is clear or blocked.