Merge pull request #173 from LLM-Coding/copilot/add-mikado-method-anchor

feat: Add Mikado Method semantic anchor

Author: rdmueller

docs/anchors/mikado-method.adoc

@@ -0,0 +1,42 @@
+= Mikado Method
+:categories: development-workflow
+:roles: software-developer, software-architect, team-lead
+:related: tdd-chicago-school, tdd-london-school
+:proponents: Ola Ellnestam, Daniel Brolund
+:tags: refactoring, legacy code, incremental change, dependency graph, reversible steps
+
+[%collapsible]
+====
+Also known as:: Mikado Graph Method
+
+[discrete]
+== *Core Concepts*:
+
+Mikado Goal:: The final desired state of the code after refactoring; the root of the dependency graph
+
+Prerequisite discovery:: Reveal blocking dependencies by attempting the change and noting what breaks
+
+Revert and repeat:: After discovering a prerequisite, revert to a working state before addressing it
+
+Mikado Graph:: A directed acyclic graph where nodes are prerequisites and edges show dependencies between them
+
+Leaf-first resolution:: Resolve the leaf nodes (no further prerequisites) first, working back to the root goal
+
+Small reversible steps:: Each step leaves the codebase in a working state, eliminating the risk of long-running broken branches
+
+Key Proponents:: Ola Ellnestam, Daniel Brolund ("The Mikado Method", 2012)
+
+[discrete]
+== *When to Use*:
+
+* Tackling large refactorings in legacy or complex codebases
+* When a direct change breaks too many things to fix at once
+* Coordinating multi-developer refactoring efforts safely
+* Making incremental improvements without blocking the team
+
+[discrete]
+== *Related Anchors*:
+
+* <<tdd-chicago-school,TDD, Chicago School>>
+* <<tdd-london-school,TDD, London School>>
+====

docs/anchors/mikado-method.de.adoc

@@ -0,0 +1,42 @@
+= Mikado-Methode
+:categories: development-workflow
+:roles: software-developer, software-architect, team-lead
+:related: tdd-chicago-school, tdd-london-school
+:proponents: Ola Ellnestam, Daniel Brolund
+:tags: refactoring, legacy code, inkrementelle Änderung, Abhängigkeitsgraph, reversible Schritte
+
+[%collapsible]
+====
+Auch bekannt als:: Mikado-Graph-Methode
+
+[discrete]
+== *Kernkonzepte*:
+
+Mikado-Ziel:: Der angestrebte Endzustand des Codes nach dem Refactoring; die Wurzel des Abhängigkeitsgraphen
+
+Voraussetzungsermittlung:: Blockierende Abhängigkeiten aufdecken, indem die Änderung versucht und notiert wird, was dabei bricht
+
+Rückgängig machen und wiederholen:: Nach dem Entdecken einer Voraussetzung den Code auf einen funktionierenden Zustand zurücksetzen, bevor diese angegangen wird
+
+Mikado-Graph:: Ein gerichteter azyklischer Graph, bei dem Knoten Voraussetzungen und Kanten die Abhängigkeiten zwischen ihnen darstellen
+
+Blatt-zuerst-Auflösung:: Zuerst die Blattknoten (ohne weitere Voraussetzungen) auflösen und von dort zurück zum Wurzelziel arbeiten
+
+Kleine reversible Schritte:: Jeder Schritt hinterlässt die Codebasis in einem funktionierenden Zustand und vermeidet das Risiko langer kaputt-Branches
+
+Schlüsselvertreter:: Ola Ellnestam, Daniel Brolund ("The Mikado Method", 2012)
+
+[discrete]
+== *Wann zu verwenden*:
+
+* Große Refactorings in Legacy- oder komplexen Codebasen angehen
+* Wenn eine direkte Änderung zu viele Dinge bricht, um sie auf einmal zu beheben
+* Koordination von Refactoring-Arbeiten mehrerer Entwickler auf sichere Weise
+* Inkrementelle Verbesserungen vornehmen, ohne das Team zu blockieren
+
+[discrete]
+== *Verwandte Anchors*:
+
+* <<tdd-chicago-school,TDD, Chicago School>>
+* <<tdd-london-school,TDD, London School>>
+====

skill/semantic-anchor-translator/references/catalog.md

@@ -267,6 +267,10 @@ Source: https://github.com/LLM-Coding/Semantic-Anchors
 - **Proponents:** Peter Naur
 - **Core:** Programming as theory building — knowledge lives in developers' heads
 
+### Mikado Method
+- **Proponents:** Ola Ellnestam, Daniel Brolund
+- **Core:** Incremental refactoring via prerequisite graph — attempt change, revert on breakage, resolve leaf dependencies first
+
 ### TIMTOWTDI
 - **Core:** There Is More Than One Way To Do It — Perl philosophy
 

website/public/data/anchors.json

@@ -1494,6 +1494,34 @@
     "tags": [],
     "filePath": "docs/anchors/mental-model-according-to-naur.adoc"
   },
+  {
+    "id": "mikado-method",
+    "title": "Mikado Method",
+    "categories": [
+      "development-workflow"
+    ],
+    "roles": [
+      "software-developer",
+      "software-architect",
+      "team-lead"
+    ],
+    "related": [
+      "tdd-chicago-school",
+      "tdd-london-school"
+    ],
+    "proponents": [
+      "Ola Ellnestam",
+      "Daniel Brolund"
+    ],
+    "tags": [
+      "refactoring",
+      "legacy code",
+      "incremental change",
+      "dependency graph",
+      "reversible steps"
+    ],
+    "filePath": "docs/anchors/mikado-method.adoc"
+  },
   {
     "id": "morphological-box",
     "title": "Morphological Box",

website/public/data/categories.json

@@ -60,6 +60,7 @@
       "bem-methodology",
       "conventional-commits",
       "mental-model-according-to-naur",
+      "mikado-method",
       "regulated-environment",
       "semantic-versioning",
       "sota",

website/public/data/metadata.json

@@ -2,7 +2,7 @@
   "generatedAt": "2026-03-12T10:36:04.925Z",
   "version": "1.0.0",
   "counts": {
-    "anchors": 95,
+    "anchors": 96,
     "categories": 12,
     "roles": 12
   },

website/public/data/roles.json

@@ -199,6 +199,7 @@
       "lasr",
       "madr",
       "mece",
+      "mikado-method",
       "morphological-box",
       "owasp-top-10",
       "pugh-matrix",
@@ -266,6 +267,7 @@
       "lasr",
       "madr",
       "mental-model-according-to-naur",
+      "mikado-method",
       "morphological-box",
       "mutation-testing",
       "owasp-top-10",
@@ -313,6 +315,7 @@
       "lasr",
       "madr",
       "mental-model-according-to-naur",
+      "mikado-method",
       "moscow",
       "myers-briggs-type-indicator",
       "owasp-top-10",