Francesco Trani vs Peter Leijen
11. LSS Anni P-00006, 2017 · Result 1–0 · Sicilian Defense: Najdorf Variation, Opocensky Variation (B92).
Turn this game into your next win
Replay Francesco Trani vs Peter Leijen 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
- Francesco Trani (1675)
- Black
- Peter Leijen (2116)
- Result
- 1–0
- Event
- 11. LSS Anni P-00006
- Year
- 2017
- Opening
- Sicilian Defense: Najdorf Variation, Opocensky Variation (B92)
About this chess game
This chess game between Francesco Trani (1675) and Peter Leijen (2116) was played at 11. LSS Anni P-00006 in 2017 and finished 1–0. The opening was the Sicilian Defense: Najdorf Variation, Opocensky Variation (B92). 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 Francesco Trani games or Peter Leijen games? This Francesco Trani vs Peter Leijen 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 Sicilian Defense: Najdorf Variation, Opocensky Variation.
Frequently asked questions
Who won Francesco Trani vs Peter Leijen?
Francesco Trani vs Peter Leijen (2017) finished 1–0, a win for Francesco Trani.
What opening was played in Francesco Trani vs Peter Leijen?
The game opened with the Sicilian Defense: Najdorf Variation, Opocensky Variation (ECO B92).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Francesco Trani vs Peter Leijen, or open it on the CipherChess analysis board to review it with the Stockfish engine.