Kamran Shirazi

Kamran Shirazi (Persian: کامران شیرازی‎; born 21 November 1952) is an International Master of chess, who won Iranian Chess Championship in 1972. Born in Tehran,[3] he has represented Iran, the United States, and France. He moved to the United States in the late 1970s and quickly became one of the most active players in the country, winning many tournaments, including the Southern California Open (five times), the World Open (tied for first in 1983), the National Open (tied for first in 1985), and the Memorial Day Classic (tied for first in 1986).[4][5]

Kamran Shirazi
Kamran Shirazi, Warsaw 2012
Country France (2006-now)
 USA (1984-2005)
 Iran (Until 1983)[1]
Born (1952-11-21) November 21, 1952
Tehran, Iran
TitleInternational Master (1978)
FIDE rating2347 (September 2019)[2]
Peak rating2457 (March 2010)
RankingNo. 3442 (September 2019)

He was known for playing strange and unorthodox openings. Shirazi's rating rose rapidly and he became one of the highest rated players in the United States Chess Federation. However, when invited to play in the 1984 U.S. Chess Championship, Shirazi managed only one draw from 17 games, finishing last.[6] In that championship, Shirazi also achieved the dubious distinction of losing the shortest decisive game in the history of the U.S. Championship: his game as White against John Peters, which went 1.e4 c5 2.b4 cxb4 3.a3 d5 4.exd5 Qxd5 5.axb4?? Qe5+ 0-1.

He subsequently made an appearance in the movie Searching for Bobby Fischer. He is introduced as "Grandmaster Shirazi" but his actual title is International Master, awarded in 1978.[3]

As of 2006, Shirazi had been living in France for several years. He is still an active tournament player and also gives lessons. He changed his FIDE federation from the US to France in 2006.

On the September 2009 FIDE list, he has an Elo rating of 2410.

Notable games

In this game, Kamran Shirazi boldly plays an extremely sharp line regarded as dubious for Black (White has won many brilliancies in this line), and beats a computer with it:

Fidelity S2 computer-Shirazi, 1986[7] 1.e4 e5 2.Nc3 Nc6 3.Bc4 Bc5 4.Qg4 Qf6?! 5.Nd5! Qxf2+ 6.Kd1 Nf6 7.Qxg7 Nxd5 8.Qxh8+ Bf8 9.exd5 Qxg2 10.dxc6 d6 11.cxb7 Bg4+ 12.Ke1 Qe4+ 13.Kf2 Qf4+ 14.Nf3 Qxf3+ 15.Kg1 Rb8 16.Qxh7 d5 17.Bb5+ c6 18.Bxc6+ Kd8 19.Qh4+ Kc7 20.Qf2 Kxc6 21.c3 Bc5 22.d4 exd4 23.cxd4 Qd1+ 24.Kg2 Bh3+ 25.Kxh3 Rh8+ 26.Kg3 Rg8+ 27.Bg5 Rxg5+ 28.Kf4 Qg4+ 29.Ke3 Qxd4+ 30.Ke2 Qxf2+ 31.Kd3 Qd4+ 32.Kc2 Rg2+ 33.Kc1 Qe3+ 34.Kb1 Qd3+ 35.Kc1 Be3# 0-1

Silman-Shirazi, Lone Pine 1979 1.e4 c5 2.Nf3 Nc6 3.Bb5 Qb6 4.Nc3 e6 5.O-O a6 6.Bc4 Qa5 7.Re1 b5 8.Bd5 Nge7 9.d3 Qc7 10.Bxc6 Nxc6 11.e5 Bb7 12.Bf4 f5 13.a4 b4 14.Nb1 Ne7 15.h4 h6 16.Nbd2 g5 17.Nc4 Ng6 18.Bg3 g4 19.h5 gxf3 20.hxg6 Rg8 21.Re3 Rxg6 22.Rxf3 Bxf3 23.Qxf3 Qc6 24.Qh5 Kf7 25.f3 Be7 26.Kh1 Kg7 27.Bh4 Rg5! 0-1 If 28.Bxg5 hxg5, White is helpless against the threat of 29...Rh8 trapping his queen.

gollark: ```sqlnonlocality=# EXPLAIN ANALYZE SELECT url, ts_rank(fts, query) AS rank, ts_headline(fts::text, query, 'MaxWords=60') FROM pages, websearch_to_tsquery('bee') query WHERE fts @@ query ORDER BY rank LIMIT 1; QUERY PLAN -------------------------------------------------------------------------------------------------------------------------------------------------- Limit (cost=860.79..861.06 rows=1 width=96) (actual time=35935.590..35935.594 rows=1 loops=1) -> Result (cost=860.79..874.83 rows=52 width=96) (actual time=35935.587..35935.589 rows=1 loops=1) -> Sort (cost=860.79..860.92 rows=52 width=178) (actual time=35934.109..35934.111 rows=1 loops=1) Sort Key: (ts_rank(pages.fts, query.query)) Sort Method: top-N heapsort Memory: 25kB -> Nested Loop (cost=0.25..860.53 rows=52 width=178) (actual time=444.148..35932.932 rows=349 loops=1) Join Filter: (pages.fts @@ query.query) Rows Removed by Join Filter: 10272 -> Function Scan on websearch_to_tsquery query (cost=0.25..0.26 rows=1 width=32) (actual time=0.038..0.041 rows=1 loops=1) -> Seq Scan on pages (cost=0.00..728.95 rows=10495 width=142) (actual time=10.189..289.581 rows=10621 loops=1) Planning Time: 0.184 ms Execution Time: 35935.637 ms(12 rows)```
gollark: What? Why does it say it's doing a sequential scan now? Æ all is bee.
gollark: Slower, even.
gollark: Oops, it turns out I'm accidentally sorting by it instead of the rank, but it's equally slow after fixing that.
gollark: ```nonlocality=# EXPLAIN ANALYZE SELECT url, ts_rank(fts, query), ts_headline(fts::text, query, 'MaxWords=60') AS rank FROM pages, websearch_to_tsquery('bee') query WHERE fts @@ query ORDER BY rank LIMIT 1; QUERY PLAN ------------------------------------------------------------------------------------------------------------------------------------------------- Limit (cost=860.92..860.92 rows=1 width=96) (actual time=8506.425..8506.427 rows=1 loops=1) -> Sort (cost=860.92..861.05 rows=52 width=96) (actual time=8506.423..8506.425 rows=1 loops=1) Sort Key: (ts_headline((pages.fts)::text, query.query, 'MaxWords=60'::text)) Sort Method: top-N heapsort Memory: 25kB -> Nested Loop (cost=688.65..860.66 rows=52 width=96) (actual time=1.362..8505.403 rows=348 loops=1) -> Function Scan on websearch_to_tsquery query (cost=0.25..0.26 rows=1 width=32) (actual time=0.023..0.025 rows=1 loops=1) -> Bitmap Heap Scan on pages (cost=688.40..846.49 rows=52 width=142) (actual time=0.353..1.502 rows=348 loops=1) Recheck Cond: (fts @@ query.query) Heap Blocks: exact=231 -> Bitmap Index Scan on page_search_index (cost=0.00..688.39 rows=52 width=0) (actual time=0.320..0.320 rows=387 loops=1) Index Cond: (fts @@ query.query) Planning Time: 0.190 ms Execution Time: 8506.463 ms(13 rows)```

References
  1. Kamran Shirazi Rating and Chess Federation history
  2. Kamran Shirazi FIDE Chess Profile
  3. Gaige, Jeremy (1987), Chess Personalia, A Biobibliography, McFarland, p. 388, ISBN 0-7864-2353-6
  4. USCF Yearbook 2007 Archived 20 November 2008 at the Wayback Machine
  5. http://www.scchess.com/champions.html
  6. 1984 US Chess Championship
  7. http://www.chessgames.com/perl/nph-chesspgn?text=1&gid=1122948

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