Julian-Frank Reuter vs Phil Heimann
Krefelder Weihnachtsopen 2025, 2025 · Result 1–0 · Hungarian Opening: Wiedenhagen-Beta Gambit (A07).
Turn this game into your next win
Replay Julian-Frank Reuter vs Phil Heimann 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
- Julian-Frank Reuter (2200)
- Black
- Phil Heimann (1772)
- Result
- 1–0
- Event
- Krefelder Weihnachtsopen 2025
- Year
- 2025
- Opening
- Hungarian Opening: Wiedenhagen-Beta Gambit (A07)
About this chess game
This chess game between Julian-Frank Reuter (2200) and Phil Heimann (1772) was played at Krefelder Weihnachtsopen 2025 in 2025 and finished 1–0. The opening was the Hungarian Opening: Wiedenhagen-Beta Gambit (A07). 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 Julian-Frank Reuter games or Phil Heimann games? This Julian-Frank Reuter vs Phil Heimann 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 Hungarian Opening: Wiedenhagen-Beta Gambit.
Frequently asked questions
Who won Julian-Frank Reuter vs Phil Heimann?
Julian-Frank Reuter vs Phil Heimann (2025) finished 1–0, a win for Julian-Frank Reuter.
What opening was played in Julian-Frank Reuter vs Phil Heimann?
The game opened with the Hungarian Opening: Wiedenhagen-Beta Gambit (ECO A07).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Julian-Frank Reuter vs Phil Heimann, or open it on the CipherChess analysis board to review it with the Stockfish engine.