Dimitris Liakos vs Fotios Margaritis
2009 · Result 0–1 · English Opening: Symmetrical Variation, Anti-Benoni Variation (A31).
Turn this game into your next win
Replay Dimitris Liakos vs Fotios Margaritis 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
- Dimitris Liakos (2047)
- Black
- Fotios Margaritis (2185)
- Result
- 0–1
- Year
- 2009
- Opening
- English Opening: Symmetrical Variation, Anti-Benoni Variation (A31)
About this chess game
This chess game between Dimitris Liakos (2047) and Fotios Margaritis (2185) was played in 2009 and finished 0–1. The opening was the English Opening: Symmetrical Variation, Anti-Benoni Variation (A31). 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 Dimitris Liakos games or Fotios Margaritis games? This Dimitris Liakos vs Fotios Margaritis 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.
Frequently asked questions
Who won Dimitris Liakos vs Fotios Margaritis?
Dimitris Liakos vs Fotios Margaritis (2009) finished 0–1, a win for Fotios Margaritis.
What opening was played in Dimitris Liakos vs Fotios Margaritis?
The game opened with the English Opening: Symmetrical Variation, Anti-Benoni Variation (ECO A31).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Dimitris Liakos vs Fotios Margaritis, or open it on the CipherChess analysis board to review it with the Stockfish engine.