Daniel Ludwig vs Egor S. Romanov
40. Annual World Open, 2012 · Result ½–½ · King's Indian Defense: Normal Variation, Rare Defenses (E90).
Turn this game into your next win
Replay Daniel Ludwig vs Egor S. Romanov 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
- Daniel Ludwig (2472)
- Black
- Egor S. Romanov (2623)
- Result
- ½–½
- Event
- 40. Annual World Open
- Year
- 2012
- Opening
- King's Indian Defense: Normal Variation, Rare Defenses (E90)
About this chess game
This chess game between Daniel Ludwig (2472) and Egor S. Romanov (2623) was played at 40. Annual World Open in 2012 and finished ½–½. The opening was the King's Indian Defense: Normal Variation, Rare Defenses (E90). 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 Daniel Ludwig games or Egor S. Romanov games? This Daniel Ludwig vs Egor S. Romanov 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 King's Indian Defense: Normal Variation, Rare Defenses.
Frequently asked questions
Who won Daniel Ludwig vs Egor S. Romanov?
Daniel Ludwig vs Egor S. Romanov (2012) finished ½–½, and the game was drawn.
What opening was played in Daniel Ludwig vs Egor S. Romanov?
The game opened with the King's Indian Defense: Normal Variation, Rare Defenses (ECO E90).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Daniel Ludwig vs Egor S. Romanov, or open it on the CipherChess analysis board to review it with the Stockfish engine.