planning-and-task-breakdown

Task breakdown uses dependency graph mapping and vertical slicing to decompose large work into ordered, verifiable tasks. Each task receives acceptance criteria and checkpoints so the implementation builds foundations first and yields working functionality early.

Vertical slicing cuts work by complete feature paths to deliver end-to-end progress and working functionality early. It sequences the implementation order to build foundations first, reducing rework and hidden dependencies across the task plan.

You identify hidden dependencies by performing read-only planning and mapping a dependency graph against existing code patterns. This exposes implementation order constraints and establishes checkpoints before starting the actual coding work.

Yes, you can stress test an implementation plan using a strategy-stress-test to detect oversized tasks, missing dependencies, and vague verification steps. This risk handling mechanism validates that your task breakdown and checkpoints are solid before coding begins.

Yes, generating task templates with acceptance criteria requires a given spec and existing code patterns as inputs. The planning process analyzes these dependencies to map an accurate implementation order and apply vertical slicing effectively.