code wiki / _hdl_build / nx_maze_gate.nx
nx_maze_gate.nx
buildroot/runtime/_hdl_build/nx_maze_gate.nx
about
nx_maze_gate.nx -- GATE for the provably-solvable maze rung (procgen-solvable + gate-solvable + rules-engine).
Proves: a generated maze is a SPANNING TREE (every cell reachable BY CONSTRUCTION), the solver finds a
start->exit path, the solver DETECTS an unsolvable level (NEG-CONTROL: seal the exit -> UNSOLVABLE, so the
solvability gate is real, not a rubber-stamp -- the property that makes autonomous emission safe), generation
is DETERMINISTIC (same seed -> identical) and VARIES (different seed -> different maze), and the render is
sovereign (pure ASCII, 0 third-party). Emits knowledge/staging/game/maze.txt. license_tier: ORIGINAL expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_maze_gen.nxnx_ad_serve.nxnx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 11 | func g_p(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 12 | func g_i(v: i64) -> i64 { let t: *u8 = sys_mmap(24); var m: i64 = v; var k: i64 = 0; if m == 0 { t[0]=48 as u8; k=1 } while m>0 { t[k]=(48+(m%10)) as u8; m=m/10; k=k+1 } let o: *u8=sys_mmap(24); var w: i64=0; var q: i64=k-1; while q>=0 { o[w]=t[q]; w=w+1; q=q-1 } sys_write(1,o,w); return 0 } |
| 13 | func eqbytes(a: *u8, b: *u8, n: i64) -> i64 { var i: i64 = 0; while i < n { if a[i] != b[i] { return 0 } i = i + 1 } return 1 } called by 1: main |
| 15 | func main(argc: i64, argv: *i64) -> i64 |