Kieseritzky Gambit

In chess, the Kieseritzky Gambit is an opening line in the King's Gambit It begins with the moves:

1. e4 e5
2. f4 exf4
3. Nf3 g5
4. h4 g4
5. Ne5
Kieseritzky Gambit
abcdefgh
8
8
77
66
55
44
33
22
11
abcdefgh
Moves1.e4 e5 2.f4 exf4 3.Nf3 g5 4.h4 g4 5.Ne5
ECOC39
OriginManuscript by Giulio Cesare Polerio, 1590
Named afterLionel Kieseritzky (1805-1853)
ParentKing's Gambit

White reacts to Black's attempt to hold the sacrificed pawn by 3...g5 by immediately undermining the pawn chain. It is one of the main lines of the King's Gambit after 3...g5, and its overall assessment is still unclear but approximately equal. The Encyclopaedia of Chess Openings classifies the Kieseritzky Gambit under code C39. C39 is also the code for the Allgaier Gambit, in which White plays 5.Ng5?!, sacrificing the knight for an attack after 5...h6 6.Nxf7 Kxf7. The Allgaier Gambit is considered dubious by modern theory.

History

The opening now known as the Kieseritzky Gambit was first described by Polerio in the late 16th century; it was also analyzed by Salvio (1604) and Philidor (1749).[1] Greco also included a game with this opening in his 1620 collection.[2] In the first edition of the Handbuch in 1843, 5.Ne5 was considered under the heading of the Allgaier Gambit, but the editors noted that Kieseritzky had contributed significantly to the theory of 5.Ne5, which they advocated as superior to 5.Ng5. The corresponding chapter in the second edition of the Handbuch in 1852 was headed "Allgaier and Kieseritzky's Gambit". Subsequently the name Kieseritzky Gambit came into general use for 5.Ne5.

gollark: I'm going to look into making Node.js use multiple *processes*, and putting SQLite in WAL mode so that it can do multiple reads at once.
gollark: It's SQLite and the application is Node.js. Both of which are totally single-threaded. Which is probably why.
gollark: I put together this simple search engine thing (https://search.osmarks.tk) as a fun project to try and practice building somewhat complex applications. It seemed to work fine on the test dataset of my website. But then I got bored and decided to have it crawl esolangs.org, and it's about a 14th of the way through after running for maybe an hour (at 1 page crawled/second), queries are running quite slowly, and the lack of pagination is causing problems. I guess this is a lesson in scaling?
gollark: Shadowbans by themselves are quite evil.
gollark: I don't see why I would want to.

See also

Notes

    References
    1. Hooper, David; Whyld, Kenneth (1996) [First pub. 1992]. "Kieseritzky Gambit". The Oxford Companion to Chess (2nd ed.). Oxford University Press. p. 200. ISBN 0-19-280049-3.
    2. "Greco vs. NN, 1620". Chessgames.com.

    Bibliography

    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.