code wiki / _hdl_build / nx_procgen_gate.nx
nx_procgen_gate.nx
buildroot/runtime/_hdl_build/nx_procgen_gate.nx
about
nx_procgen_gate.nx -- proves procedural maze generation (GR-S-R5 RESEARCHED->PRESENT) AND composes it with the
just-built A* (nx_pathfind). (1) DETERMINISTIC: same seed -> byte-identical maze; (2) FULLY CONNECTED: BFS flood
from (1,1) reaches EVERY open cell (perfect-maze property -- no isolated regions); (3) TRAVERSABLE (composition):
A* finds a path from (1,1) to the far corner; (4) GENERATES (not clone): a different seed -> a different maze.
Pure-Nishi no-float. license_tier: ORIGINAL expect_exit: 0
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_procgen.nxnx_pathfind.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
| 10 | const MW: i64 = 15 |
| 11 | const MH: i64 = 15 |
functions
| 13 | func w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 14 | func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); 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} var i:i64=0; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 15 | func row(id: *u8, ok: i64, pass: *i64) -> i64 { w(" " as *u8); w(id); w(": " as *u8); if ok==1 { w("OK\n" as *u8); pass[0]=pass[0]+1 } else { w("FAIL\n" as *u8) } return 0 } |
| 17 | func main() -> i64 |