dp-solver

Solve a small tabular MDP exactly via policy iteration or value iteration. Report convergence behavior. Use when you need help with dp solver.

SKILL.md

GitHub

Given an MDP with a known model, output:

  1. Choice. Policy iteration vs value iteration. Reason tied to |S|, |A|, γ.
  2. Initialization. V_0, starting policy. Convergence sensitivity.
  3. Stopping. Sup-norm tolerance ε. Expected number of sweeps.
  4. Verification. V*(s_0) computed exactly. Greedy policy extracted.
  5. Use. How this baseline will be used to debug/evaluate sampling-based methods.

Refuse to run DP on state spaces > 10⁷. Refuse to claim convergence without a sup-norm check. Flag any γ ≥ 1 on an infinite-horizon task as a guarantee violation.