Daniel Schulz vs Moritz Weishaeutel
Lueneburg Open A 2019, 2019 · Result 0–1 · Benko Gambit Accepted: Fully Accepted Variation (A58).
Turn this game into your next win
Replay Daniel Schulz vs Moritz Weishaeutel 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 Schulz (1521)
- Black
- Moritz Weishaeutel (2270)
- Result
- 0–1
- Event
- Lueneburg Open A 2019
- Year
- 2019
- Opening
- Benko Gambit Accepted: Fully Accepted Variation (A58)
About this chess game
This chess game between Daniel Schulz (1521) and Moritz Weishaeutel (2270) was played at Lueneburg Open A 2019 in 2019 and finished 0–1. The opening was the Benko Gambit Accepted: Fully Accepted Variation (A58). 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 Schulz games or Moritz Weishaeutel games? This Daniel Schulz vs Moritz Weishaeutel 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 Benko Gambit Accepted: Fully Accepted Variation.
Frequently asked questions
Who won Daniel Schulz vs Moritz Weishaeutel?
Daniel Schulz vs Moritz Weishaeutel (2019) finished 0–1, a win for Moritz Weishaeutel.
What opening was played in Daniel Schulz vs Moritz Weishaeutel?
The game opened with the Benko Gambit Accepted: Fully Accepted Variation (ECO A58).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Daniel Schulz vs Moritz Weishaeutel, or open it on the CipherChess analysis board to review it with the Stockfish engine.