Finite Decision-tree Rollback

How to use Finite Decision-tree Rollback

Validate one rooted tree, then work backward from terminal values. Chance nodes use the entered probability-weighted expectation; decision nodes choose the entered objective. Nonnegative edge costs subtract from rewards and add to costs.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Validate one rooted tree, then work backward from terminal values. Chance nodes use the entered probability-weighted expectation; decision nodes choose the entered objective. Nonnegative edge costs subtract from rewards and add to costs.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 1–300 unique nodes, at most 50 branches per node and depth at most 12 edges. Every nonroot node must have one parent, every node must be reachable and chance probabilities must sum exactly to one.
• Decimal terminal values range from −1,000,000,000 to 1,000,000,000; branch costs are nonnegative. No probability estimation, learned model, causal conclusion or real-world recommendation.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.