Connected pawns

In chess, connected pawns are two or more pawns of the same color on adjacent files, as distinct from isolated pawns. These pawns are instrumental in creating pawn structure because, when diagonally adjacent, like the two rightmost white pawns, they form a pawn chain, a chain where the one behind protects the one in front. When attacking these chains, the weak spot is the backmost pawn, because it is not protected (Seirawan 2003:186) (Seirawan 2005:92).

abcdefgh
8
8
77
66
55
44
33
22
11
abcdefgh
White's pawns on the a-, b- and, c-files are connected; and White's g- and h-pawns are connected.

Discussion

Connected pawns that are both passed, i.e., without any enemy pawns in front of them on the same file or adjacent files, are referred to as connected passed pawns. Such pawns can be very strong in the endgame, especially if supported by other pieces. Often the opponent must sacrifice material to prevent one of the pawns from promoting.

Connected passed pawns are usually superior to other passed pawns. An exception is in an opposite-colored bishops endgame with a bishop and two pawns versus a bishop on the opposite color. If the pawns are connected and not beyond their fifth rank, the position is a theoretical draw whereas widely separated pawns would win.

Two connected pawns on the same rank without any friendly pawns on adjacent files are called hanging pawns.

Connected passed pawns
From Burgess
abcdefgh
8
8
77
66
55
44
33
22
11
abcdefgh
White to move wins after 1.c6

There is a saying that two connected passed pawns on the sixth rank are stronger than a rook. This is true if the other side has nothing but a rook to defend against the pawns (and the defender cannot immediately capture one of the pawns). In this diagram, White wins:

1. c6 Rd3
1...Rc3 is similar.
2. c7
2.d7 followed by 3.c7 also wins.
2... Rc3 3. d7
And one of the pawns will promote (Burgess 2009:94).

See also

References
    • Burgess, Graham (2009), The Mammoth Book of Chess (3rd ed.), Running Press, ISBN 978-0-7624-3726-9
    • Seirawan, Yasser (2003), Play Winning Chess, Everyman Chess, ISBN 1-85744-331-4
    • Seirawan, Yasser (2005), Winning Chess Tactics, Everyman Chess, ISBN 1-85744-385-3
    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.