Tomas Polak vs Sergei Ovsejevitsch
2007 · Result ½–½ · Queen's Indian Defense: Classical Variation, Traditional Variation (E18).
Turn this game into your next win
Replay Tomas Polak vs Sergei Ovsejevitsch 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
- Tomas Polak (2544)
- Black
- Sergei Ovsejevitsch (2568)
- Result
- ½–½
- Year
- 2007
- Opening
- Queen's Indian Defense: Classical Variation, Traditional Variation (E18)
About this chess game
This chess game between Tomas Polak (2544) and Sergei Ovsejevitsch (2568) was played in 2007 and finished ½–½. The opening was the Queen's Indian Defense: Classical Variation, Traditional Variation (E18). 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 Tomas Polak games or Sergei Ovsejevitsch games? This Tomas Polak vs Sergei Ovsejevitsch 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 Queen's Indian Defense: Classical Variation, Traditional Variation.
Frequently asked questions
Who won Tomas Polak vs Sergei Ovsejevitsch?
Tomas Polak vs Sergei Ovsejevitsch (2007) finished ½–½, and the game was drawn.
What opening was played in Tomas Polak vs Sergei Ovsejevitsch?
The game opened with the Queen's Indian Defense: Classical Variation, Traditional Variation (ECO E18).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Tomas Polak vs Sergei Ovsejevitsch, or open it on the CipherChess analysis board to review it with the Stockfish engine.