strategy: use \chapter

[topbloke-formulae.git] / strategy.tex

diff --git a/strategy.tex b/strategy.tex
index 50efed7c8598cbf61a0e9b349b9dece2e3634267..4cd80db8ff0e71941307ea0bb36e1ea7ac5b4161 100644 (file)
--- a/strategy.tex
+++ b/strategy.tex
@@ -1,11 +1,9 @@
-\section{Strategy}
-
 When we are trying to do a merge of some kind, in general,
 we want to merge some source commits $S_0 \ldots S_n$.
 We'll write $S_0 = L$.  We require that $L$ is the current git ref
 for $\patchof{L}$.
 
-\subsection{Notation}
+\stdsection{Notation}
 
 \begin{basedescript}{
 \desclabelwidth{5em}
@@ -31,7 +29,7 @@ All the ends of $\pc$ in the sources.
 
 \end{basedescript}
 
-\subsection{Planning phase}
+\section{Planning phase}
 
 We use a recursive planning algorith, recursing over Topbloke commit
 sets (ie, sets $\py$ or $\pn$).  We'll call the commit set we're
@@ -47,7 +45,7 @@ corresponding to the tip branches for the direct dependencies of
 $\pc$.
 The sole direct contributor of $\pcy$ is $\pcn$.
 
-\subsubsection{Planning step for $\pc = \pcn$.}
+\subsection{Planning step for $\pc = \pcn$.}
 
 Choose an (arbitrary, but ideally somehow optimal in
 a way not discussed here) ordering of $\set E_{\pc}$, $E_j$ (for