Paul Muljadi vs Daniel Edward Parmet
BITNY 2019/B (USA), 2019 · Result ½–½ · Slav Defense: Quiet Variation, Schallopp Defense (D12).
Turn this game into your next win
Replay Paul Muljadi vs Daniel Edward Parmet 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
- Paul Muljadi (2388)
- Black
- Daniel Edward Parmet (1929)
- Result
- ½–½
- Event
- BITNY 2019/B (USA)
- Year
- 2019
- Opening
- Slav Defense: Quiet Variation, Schallopp Defense (D12)
About this chess game
This chess game between Paul Muljadi (2388) and Daniel Edward Parmet (1929) was played at BITNY 2019/B (USA) in 2019 and finished ½–½. The opening was the Slav Defense: Quiet Variation, Schallopp Defense (D12). 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 Paul Muljadi games or Daniel Edward Parmet games? This Paul Muljadi vs Daniel Edward Parmet 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 Slav Defense: Quiet Variation, Schallopp Defense.
Frequently asked questions
Who won Paul Muljadi vs Daniel Edward Parmet?
Paul Muljadi vs Daniel Edward Parmet (2019) finished ½–½, and the game was drawn.
What opening was played in Paul Muljadi vs Daniel Edward Parmet?
The game opened with the Slav Defense: Quiet Variation, Schallopp Defense (ECO D12).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Paul Muljadi vs Daniel Edward Parmet, or open it on the CipherChess analysis board to review it with the Stockfish engine.