Stephen C Crowdy vs Jonathan Richard Owens
FRA-70/pr40 (FRA), 2007 · Result 0–1 · Benoni Defense: Four Pawns Attack, Main Line (A69).
Turn this game into your next win
Replay Stephen C Crowdy vs Jonathan Richard Owens 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
- Stephen C Crowdy (2030)
- Result
- 0–1
- Event
- FRA-70/pr40 (FRA)
- Year
- 2007
- Opening
- Benoni Defense: Four Pawns Attack, Main Line (A69)
About this chess game
This chess game between Stephen C Crowdy (2030) and Jonathan Richard Owens was played at FRA-70/pr40 (FRA) in 2007 and finished 0–1. The opening was the Benoni Defense: Four Pawns Attack, Main Line (A69). 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 Stephen C Crowdy games or Jonathan Richard Owens games? This Stephen C Crowdy vs Jonathan Richard Owens 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 Benoni Defense: Four Pawns Attack, Main Line.
Frequently asked questions
Who won Stephen C Crowdy vs Jonathan Richard Owens?
Stephen C Crowdy vs Jonathan Richard Owens (2007) finished 0–1, a win for Jonathan Richard Owens.
What opening was played in Stephen C Crowdy vs Jonathan Richard Owens?
The game opened with the Benoni Defense: Four Pawns Attack, Main Line (ECO A69).
Can I replay this chess game move by move?
Yes. Use the interactive board on this page to step through every move of Stephen C Crowdy vs Jonathan Richard Owens, or open it on the CipherChess analysis board to review it with the Stockfish engine.