lexgm
A game master that never breaks its own rules.
Compile game rulebooks into queryable constraint engines — a symbolic checker plus an LLM arbitrator.
LLM game masters drift: they contradict the rules, lose state, and railroad players over a long session. Pure-LLM arbitration is neither reliable nor auditable for the determinate parts of a ruleset.
Compile the rulebook into a probabilistic rule graph, route determinate rules to a 100%-accurate symbolic checker, and send only the genuinely ambiguous remainder to a grounded LLM arbitrator — separating what can be decided exactly from what needs judgment.
Rulebook compiler
Parses any rulebook into a queryable constraint graph of rules and their conditions.
Symbolic checker
Resolves determinate rules deterministically — no model in the loop, no drift.
Grounded arbitrator
Routes only ambiguous calls to an LLM that reasons against the compiled rules.
Auditable rulings
Every ruling traces to the rule (or the arbitration) that produced it.