Péter Prohászka
| Péter Prohászka | |
|---|---|
 Péter Prohászka, 2015 | |
| Country | Hungary |
| Born | 13 January 1992 (age 32) Vác, Hungary |
| Title | Grandmaster (2010) |
| FIDE rating | 2545 (November 2024) |
| Peak rating | 2627 (August 2018) |
Péter Prohászka (born 13 January 1992) is a Hungarian chess grandmaster.
Chess career
[edit]Born in 1992, Prohászka earned his international master title in 2007 and his grandmaster title in 2010.[1] He is the No. 10 ranked Hungarian player as of February 2018.[2]
He won the Xtracon Open in 2014 and the Fano Chess Festival twice.
In 2017, he tied for first at the prestigious Benasque Open.[3]
European U-14 Champion in 2006.[4]
Winner of First Saturday October 2006 (1st GM norm) and First Saturday February 2008 (2nd GM norm).
Winner of First Saturday November 2009 (3rd GM norm).[5]
In 2019, Prohászka won the US Thanksgiving Open tied with Illia Nyzhnyk and Cemil Can Ali Marandi.[6]
In 2021, Prohaszka tied for first place with IM Christopher Yoo in the Memorial Day 2021 CCCSA GM Norm Invitational tournament.[7]
References
[edit]- ^ 1st quarter Presidential Board 2010, 3-6 January 2010, Bursa, TUR FIDE
- ^ Staff writer(s) (February 2018). "Federations Ranking - Hungary". FIDE. Archived from the original on 2018-02-10. Retrieved 2018-02-11.
- ^ "Peter Prohaszka | www.uschesschamps.com". uschesschamps.com. Retrieved 2020-06-16.
- ^ "European Youth Chess Championship 2006 - Boys U14 January 2007 FIDE Chess Tournament report". ratings.fide.com. Retrieved 2020-06-16.
- ^ "The chess games of Peter Prohaszka". www.chessgames.com. Retrieved 2020-06-16.
- ^ "2019 Thanksgiving Open January 2020 United States of America FIDE Chess Tournament report". ratings.fide.com. Retrieved 2020-06-16.
- ^ "CCCSA GM/IM Norm Invitational - Labor Day 2021 GM/IM Norm Invitational Chess Tournament".
External links
[edit]- Peter Prohaszka player profile and games at Chessgames.com
- Peter Prohaszka rating card at FIDE
  | This biographical article relating to a Hungarian chess figure is a stub. You can help Wikipedia by expanding it. |