-
March Madness Without Monte Carlo
Three NCAA tournament Petri nets, each solved by ODE and by Monte Carlo, suggest a two-axis rule (coupling × token count) for when the two agree. On the bracket net an exact forward propagation over the matchups replaces 150,000 simulated games with 256 configurations, though the code reads the bracket's game list rather than its incidence matrix.
-
Paper: Incidence Reduction via Petri Net ODE Equilibrium
A draft paper formalizing incidence reduction — the ODE equilibrium of an analysis net is exactly the reciprocal of each entity's constraint count — checked on tic-tac-toe, poker, Connect Four, and Hex, with the tests linked.
-
The Incidence Reduction
With uniform rates, the tic-tac-toe ODE ranks cells by incidence degree — the number of win lines through each one — approximately on the game net and exactly on the decoupled analysis net. The go-pflow and pflow-rs tests are linked, and the rate-recovery procedure is marked as not yet built.