p.boxed
- | If a piece captures one of the same kind, both disappear.
-
-// TODO:
- // Due to random 2 ranks: no castling (would reveal too much)
- // To not reveal much, also no en passant
+ | Piece placement is hidden: players know where opposing units are, but don't
+ | know exactly which piece is which.
p.
- The defensive power of pawns is thus increased, because they don't fear
- captures (by other pawns).
+ Pieces remain hidden until they capture an opposing piece,
+ at which point they are revealed.
p.
- Endings are also affected quite a lot, and sometimes new threats occur:
- on the diagram, 3.Bxg7 wins a pawn because 3...Bxg7 would make both
- bishops disappear.
+ There is no castling, and no en passant capture.
+ Pawns may, however, move two spaces if they start on the first or second row.
+
+p The game is won by capturing the opposing King.
figure.diagram-container
.diagram
- | fen:r1bqkbnr/pp1ppppp/2n5/2p5/8/1P6/PBPPPPPP/RN1QKBNR:
- figcaption After 1.b3 c5 2.Bb2 Nc6
+ | fen:qbppnprp/prpbpkpn/8/8/8/8/QBPPNPRP/PRPPKBPN:
+ figcaption Possible starting position.
+
+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)