TDD Enforcement Algorithm

Overview

Agents follow algorithmic decision trees (100% compliance) better than imperative instructions (0-33% compliance) for enforcing test-first development. Boolean conditions remove interpretation: "Does failing test exist? NO → STOP" vs "You MUST write tests first" (agent: "for complex code, mine is simple").

Core principle: Binary checks before implementation. Recovery mandates deleting untested code (no sunk cost exceptions).

When to Use

Use this algorithm when:

• About to write implementation code (functions, methods, classes)
• Code exists without tests (recovery path)
• Under pressure (time, sunk cost, authority) where TDD bypass tempting
• Need deterministic enforcement (no acceptable exceptions)