nw-mikado-methodlisted

# Mikado Method Use for complex refactoring where direct implementation causes cascading failures across multiple classes/modules. ## When to Use - Refactoring goal affects multiple classes/modules | Direct implementation causes cascade of failures - Dependencies not immediately clear | High risk of breaking existing functionality ## Core Process Cycle: Set Goal > Experiment > Visualize prerequisites > Revert to working state. Treat compilation/test failures as valuable information -- each failure reveals a prerequisite node in the dependency graph. Revert keeps codebase shippable at all times. ## Discovery-Tracking Protocol Commit immediately after each dependency discovery to preserve exploration history and enable interrupt/resume. ### Commit Formats - Dependency: `Discovery: [Class.Method(params)] requires [Prerequisite] in [File:Line]` - False leaf: `Discovery: False leaf - [Node] blocked by [Dependency]` - Exploration complete: `Discovery: No new dependencies found - exploration complete for [GoalArea]` - Ready: `Ready: True leaves identified - [Count] leaves ready for execution` ## Exhaustive Exploration Algorithm Sequence: EXPERIMENT > LEARN > GRAPH > COMMIT GRAPH > REVERT 1. **Experiment**: Attempt naive implementation of stated goal 2. **Learn**: Capture ALL compilation and test failures immediately 3. **Graph**: Create concrete prerequisite nodes with exact specifications 4. **Commit Graph**: Commit discovery with mandatory format 5. **Revert**: Revert A