Serghei Vedmediuc vs Alexandr Ogleznev
2010 · Result 1–0 · Sicilian Defense: Taimanov Variation, Bastrikov Variation (B49).
Turn this game into your next win
Replay Serghei Vedmediuc vs Alexandr Ogleznev 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
- Serghei Vedmediuc (2459)
- Black
- Alexandr Ogleznev (2388)
- Result
- 1–0
- Year
- 2010
- Opening
- Sicilian Defense: Taimanov Variation, Bastrikov Variation (B49)
About this chess game
This chess game between Serghei Vedmediuc (2459) and Alexandr Ogleznev (2388) was played in 2010 and finished 1–0. The opening was the Sicilian Defense: Taimanov Variation, Bastrikov Variation (B49). 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 Serghei Vedmediuc games or Alexandr Ogleznev games? This Serghei Vedmediuc vs Alexandr Ogleznev 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 Sicilian Defense: Taimanov Variation, Bastrikov Variation.
Frequently asked questions
Who won Serghei Vedmediuc vs Alexandr Ogleznev?
Serghei Vedmediuc vs Alexandr Ogleznev (2010) finished 1–0, a win for Serghei Vedmediuc.
What opening was played in Serghei Vedmediuc vs Alexandr Ogleznev?
The game opened with the Sicilian Defense: Taimanov Variation, Bastrikov Variation (ECO B49).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Serghei Vedmediuc vs Alexandr Ogleznev, or open it on the CipherChess analysis board to review it with the Stockfish engine.