Petr Mlynek vs Sergey Fokin
2010 · Result ½–½ · English Opening: Symmetrical Variation, Anti-Benoni Variation, Spielmann Defense (A32).
Turn this game into your next win
Replay Petr Mlynek vs Sergey Fokin with deep analysis, save the moments that matter, fold the ideas into your own opening repertoire, and drill the positions until they're second nature. CipherChess turns the games you study into the results you get — free to start.
Start Free on CipherChessMore Games By These Players
Game details
- White
- Petr Mlynek (2218)
- Black
- Sergey Fokin (1930)
- Result
- ½–½
- Year
- 2010
- Opening
- English Opening: Symmetrical Variation, Anti-Benoni Variation, Spielmann Defense (A32)
About this chess game
This chess game between Petr Mlynek (2218) and Sergey Fokin (1930) was played in 2010 and finished ½–½. The opening was the English Opening: Symmetrical Variation, Anti-Benoni Variation, Spielmann Defense (A32). You can replay the full game move by move on the interactive board above, or open it on the CipherChess analysis board to study every move with the Stockfish engine.
Looking for more Petr Mlynek games or Sergey Fokin games? This Petr Mlynek vs Sergey Fokin encounter is one of millions of chess games indexed in the CipherChess mega database. Browse both players' full records, the openings they play most, and head-to-head results, then load any game onto the board to prepare your own lines against the English Opening: Symmetrical Variation, Anti-Benoni Variation, Spielmann Defense.
Frequently asked questions
Who won Petr Mlynek vs Sergey Fokin?
Petr Mlynek vs Sergey Fokin (2010) finished ½–½, and the game was drawn.
What opening was played in Petr Mlynek vs Sergey Fokin?
The game opened with the English Opening: Symmetrical Variation, Anti-Benoni Variation, Spielmann Defense (ECO A32).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Petr Mlynek vs Sergey Fokin, or open it on the CipherChess analysis board to review it with the Stockfish engine.