X-Git-Url: https://git.auder.net/?a=blobdiff_plain;f=client%2Fsrc%2Ftranslations%2Frules%2FHidden%2Fen.pug;h=e67441c1b8d71bf098dc9a0c41d8e711669d7c93;hb=HEAD;hp=4ff27ffd62b3e4090da51f4f1918e37efaf642f5;hpb=af7b42f92255dac88f428eb6b3238cfc899df146;p=vchess.git

diff --git a/client/src/translations/rules/Hidden/en.pug b/client/src/translations/rules/Hidden/en.pug
index 4ff27ffd..e67441c1 100644
--- a/client/src/translations/rules/Hidden/en.pug
+++ b/client/src/translations/rules/Hidden/en.pug
@@ -14,16 +14,23 @@ p The game is won by capturing the opposing King.
 
 figure.diagram-container
   .diagram
-    | fen:qbppnprp/prppbkpn/8/8/8/8/QBPPNPRP/PRPPBKPN:
+    | fen:qbppnprp/prpbpkpn/8/8/8/8/QBPPNPRP/PRPPKBPN:
   figcaption Possible starting position.
 
-p.
-  Note about starting position: pieces are randomly set on the two first ranks.
-  The king may be on second rank, and attacked by an enemy rook or queen.
-  However, since you don't have this information this is a risky bet :)
+p Notes
+ul
+  li.
+    The computer uses a basic strategy, way inferior to what a human could do
+    but still better than random play.
+  li.
+    Pieces are randomly set on the two first ranks.
+    The king may be on second rank, and attacked by an enemy rook or queen.
+    However, since you don't have this information this is a risky bet :)
 
 h3 Source
 
 p
   a(href="https://www.chessvariants.com/rules/strate-go-chess") Strate-Go chess
   |  on chessvariants.com.
+
+p Inventor: John Kipling Lewis (2005)