Tobias Dierkes vs Quentin Loiseau
15. Vins du Medoc, 2012 · Result 0–1 · Benoni Defense: Fianchetto Variation, Hastings Defense (A63).
Turn this game into your next win
Replay Tobias Dierkes vs Quentin Loiseau 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
- Tobias Dierkes (2116)
- Black
- Quentin Loiseau (2368)
- Result
- 0–1
- Event
- 15. Vins du Medoc
- Year
- 2012
- Opening
- Benoni Defense: Fianchetto Variation, Hastings Defense (A63)
About this chess game
This chess game between Tobias Dierkes (2116) and Quentin Loiseau (2368) was played at 15. Vins du Medoc in 2012 and finished 0–1. The opening was the Benoni Defense: Fianchetto Variation, Hastings Defense (A63). 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 Tobias Dierkes games or Quentin Loiseau games? This Tobias Dierkes vs Quentin Loiseau 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 Benoni Defense: Fianchetto Variation, Hastings Defense.
Frequently asked questions
Who won Tobias Dierkes vs Quentin Loiseau?
Tobias Dierkes vs Quentin Loiseau (2012) finished 0–1, a win for Quentin Loiseau.
What opening was played in Tobias Dierkes vs Quentin Loiseau?
The game opened with the Benoni Defense: Fianchetto Variation, Hastings Defense (ECO A63).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Tobias Dierkes vs Quentin Loiseau, or open it on the CipherChess analysis board to review it with the Stockfish engine.