Sturmian edits

Retrograde edits
2026-03-15 08:01:45 -07:00 · 2026-03-15 08:01:40 -07:00
3 changed files with 3 additions and 4 deletions
--- a/src/Advanced/De
+++ b/src/Advanced/De
@@ -49,7 +49,6 @@ Have an instructor check your solution.
 				(0) edge (2)
 				(2) edge (3)
 				(2) edge[bend left] (4)
-				(4) edge[bend left] (2)
 				(3) edge (1)
 				(4) edge (3)
 				(4) edge[loop right] (4)
--- a/src/Advanced/De
+++ b/src/Advanced/De
@@ -375,7 +375,7 @@ Construct a minimal Sturmain word of order 5.


 \problem{}
-Argue that the words we get by \ref{sturmanthm} are minimal Sturmain words. \par
+Show that the words we get by \ref{sturmanthm} are minimal Sturmain words. \par
 That is, the word $w$ has length $2n$ and $\mathcal{S}_m(w) = m + 1$ for all $m \leq n$.

 \begin{solution}
--- a/src/Advanced/Retrograde
+++ b/src/Advanced/Retrograde
@@ -252,7 +252,7 @@ It is Black's move. Can Black castle? \par
 \difficulty{2}{5}

 Neither Black nor White captured a piece on their last move. \par
-It is Black's move. Can he castle? \par
+It is Black's move. Show that he cannot castle? \par
 \hint{What was White's last move? Check the cases.}

 \manyboards{
@@ -348,7 +348,7 @@ It is White's move. What was the previous move?
 	Bc8,
 	pg6,
 	Pg5,kh5,
-	Pd4,Qg4,Bh4,
+	Pd4,qg4,bh4,
 	pd3,
 	Pd2,Be2,Bg2,
 	Nc1,rd1,Ne1,Kf1,Qg1,Rh1
Author	SHA1	Message	Date
Mark	22f53be42d	Sturmian edits All checks were successful CI / Typst formatting (pull_request) Successful in 9s Details CI / Typos (pull_request) Successful in 53s Details CI / Build (pull_request) Successful in 6m35s Details CI / Typst formatting (push) Successful in 5s Details CI / Typos (push) Successful in 12s Details CI / Build (push) Successful in 6m35s Details	2026-03-15 08:01:45 -07:00
Mark	7cb1f04fb4	Retrograde edits	2026-03-15 08:01:40 -07:00