Maxim Litvinov vs Maxim Lugovskoy
Polugaevsky Mem 2014, 2014 · Result 0–1 · French Defense: Winawer Variation, Advance Variation (C19).
Turn this game into your next win
Replay Maxim Litvinov vs Maxim Lugovskoy 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
- Maxim Litvinov (2198)
- Black
- Maxim Lugovskoy (2397)
- Result
- 0–1
- Event
- Polugaevsky Mem 2014
- Year
- 2014
- Opening
- French Defense: Winawer Variation, Advance Variation (C19)
About this chess game
This chess game between Maxim Litvinov (2198) and Maxim Lugovskoy (2397) was played at Polugaevsky Mem 2014 in 2014 and finished 0–1. The opening was the French Defense: Winawer Variation, Advance Variation (C19). 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 Maxim Litvinov games or Maxim Lugovskoy games? This Maxim Litvinov vs Maxim Lugovskoy 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 French Defense: Winawer Variation, Advance Variation.
Frequently asked questions
Who won Maxim Litvinov vs Maxim Lugovskoy?
Maxim Litvinov vs Maxim Lugovskoy (2014) finished 0–1, a win for Maxim Lugovskoy.
What opening was played in Maxim Litvinov vs Maxim Lugovskoy?
The game opened with the French Defense: Winawer Variation, Advance Variation (ECO C19).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Maxim Litvinov vs Maxim Lugovskoy, or open it on the CipherChess analysis board to review it with the Stockfish engine.