Abram Gurvich

Abram Solomonovich Gurvich (Russian Абра́м Соломо́нович Гу́рвич) was a Russian composer of chess endgame studies. He was born in Baku on February 11, 1897, worked as literature and theatrical reviewer. His first chess study was published in 1926. Gurvich composed more than 100 endgame studies. Died in Moscow on November 18, 1962. At the end of the 1940s he was one of the main targets of the so-called campaign against the "rootless cosmopolitans".

A study by Abram Gurvich
Abram Gurvich
Schachmaty 1928
abcdefgh
8
8
77
66
55
44
33
22
11
abcdefgh
White to move and win (4 + 2)

Solution:

1. Nb6-d7 Bc7!

(1…Bf4 2. Kg4 and 3. Kf5; if 1… Ba7, then 2. Ne5! Kg7 3. Bb2!)

2. Nd7-f8 Bc7-e5!
3. Kh3-g4! Be5-b2!
4. Ba3-c5! Bb2-d4!
5. g6-g7!! K:g7 (5... B:g7 6. Be3 mate)
6. Nf8-e6+

Works
  • Этюды (Chess Studies, Russian), Moscow, 1961.
gollark: That sounds like it might be excessively expensive for stuff which doesn't actually happen all that often.
gollark: The transit files are a serialized datascript database or something and may be hard for other programs to read. Also, I think it mostly stores data in memory, so you wouldn't see your changes instantly.
gollark: If the probability of false positives is low relative to the number of possible keys, it's probably fine™.
gollark: I don't think you can *in general*, but you'll probably know in some cases what the content might be. Lots of network protocols and such include checksums and headers and defined formats, which can be validated, and English text could be detected.
gollark: But having access to several orders of magnitude of computing power than exists on Earth, and quantum computers (which can break the hard problems involved in all widely used asymmetric stuff) would.


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