#hexgrid

#Game coverage

#Shared design principles

• Pure and deterministic — every function is a mathematical operation on the grid: no I/O, no global state, no randomness. The same inputs always produce the same outputs on every backend.
• Zero dependencies — only moonbitlang/core; the binary heap and all algorithms are implemented from scratch.
• Caller-owned semantics — passability, terrain costs and transparency are caller-supplied functions; hexgrid imposes no game rules.

#Installation

moon add wbgxiaosu/hexgrid

import {
  "wbgxiaosu/hexgrid/hex",
  "wbgxiaosu/hexgrid/path",
  "wbgxiaosu/hexgrid/fov",
}

#Usage

///|
fn main raise {
  let start = @hex.Hex::make(0, 0)
  let goal = @hex.Hex::make(4, -2)
  // straight-line geometry
  println("distance: \{start.distance(goal)}") // 4
  // pathfinding around a wall on column q = 1
  fn passable(c : @hex.Hex) -> Bool {
    !(c.q == 1 && c.r != -1)
  }
  match @path.find_path(start, goal, passable, fn(_f, _t) { 1.0 }) {
    Some(steps) => println("detour: \{steps.length() - 1} steps") // 4
    None => println("unreachable")
  }
}

$ moon run cmd/main
distance 0;0 -> 4;-2 = 4
line 0;0 -> 4;-2: 0;0 1;0 2;-1 3;-1 4;-2
range 2 has 19 cells; ring 2 has 12
A* path (4 steps, detouring the wall): 0;0 -> 1;-1 -> 2;-1 -> 3;-1 -> 4;-2
visible cells (16): -2;0, -2;1, -2;2, -1;-1, -1;0, -1;1, -1;2, 0;-2, 0;-1, 0;0, 0;1, 0;2, 1;-2, 1;-1, 1;0, 2;-2

#Independent consumer example

$ cd examples/consumer && moon run .
consumer A* steps: 4
consumer fov cells: 19
consumer example OK

#Building and testing

moon check --deny-warn
moon test --deny-warn
moon run cmd/main
cd examples/consumer && moon run .

#Scope statement

#Roadmap

• hex-map storage container with rectangle/hexagon/parallelogram region shapes;
• symmetric shadowcasting FOV as an alternative to the line-based model;
• Dijkstra maps with multiple sources and falloff functions.

#Acceptance

#License