David Hardingham vs Phillip J Beckett
ENG/VC3/SF A (ENG), 2022 · Result 1–0 · Italian Game: Two Knights Defense, Knight Attack (C57).
Turn this game into your next win
Replay David Hardingham vs Phillip J Beckett 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
- David Hardingham
- Black
- Phillip J Beckett (1903)
- Result
- 1–0
- Event
- ENG/VC3/SF A (ENG)
- Year
- 2022
- Opening
- Italian Game: Two Knights Defense, Knight Attack (C57)
About this chess game
This chess game between David Hardingham and Phillip J Beckett (1903) was played at ENG/VC3/SF A (ENG) in 2022 and finished 1–0. The opening was the Italian Game: Two Knights Defense, Knight Attack (C57). 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 David Hardingham games or Phillip J Beckett games? This David Hardingham vs Phillip J Beckett 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 Italian Game: Two Knights Defense, Knight Attack.
Frequently asked questions
Who won David Hardingham vs Phillip J Beckett?
David Hardingham vs Phillip J Beckett (2022) finished 1–0, a win for David Hardingham.
What opening was played in David Hardingham vs Phillip J Beckett?
The game opened with the Italian Game: Two Knights Defense, Knight Attack (ECO C57).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of David Hardingham vs Phillip J Beckett, or open it on the CipherChess analysis board to review it with the Stockfish engine.