Skip to main content

Computer chess analysis

Computer chess analysis is simply mind-boggling ……………💂💂💂
See for yourself …………………..

[Site "chessdrive.com"]
[Date "July 24, 2017"]
[White "Anonymous"]
[Black "008"]

1. d4 d5 2. f4 e6 3. e3 Nf6 4. Nh3 Be7 5. Nf2 O-O
6. Be2 c5 7. h4 cxd4 8. exd4 Ne4 9. Nxe4 dxe4 10. g3 Nc6
11. Be3 Bf6 12. c3 e5 13. d5 Ne7 14. Bc4 a6 15. Qb3 b5
16. Be2 Qxd5 17. c4 bxc4 18. Bxc4 Qc6 19. Nd2 Be6
20. Rc1 Bxc4 21. Rxc4 Qb5 22. Rb4 Qd5 23. Qxd5 Nxd5
24. Rb3 Nxe3 25. Rxe3 exf4 26. Rxe4 h6 27. gxf4

Strength              White    Black  ( Me )
Excellent              15           14
Good     5              4
Inaccuracy (?!)  4              4
Mistake (?)         2              2
Blunder (??)       1              2
Forced  0              0
Best Move          36.0%    44.0%
Avg. Diff               0.64        0.65
1. d4 d5 2. f4
D00: Queen's Pawn Opening: Mason Attack with 2.f4
2... e6 3. e3 Nf6 4. Nh3 Be7 5. Nf2 O-O 6. Be2 c5 7. h4 cxd4 8. exd4 Ne4 9. Nxe4 dxe4 10. g3 Nc6 11. Be3 Bf6MISTAKE (+0.12) The best move was 11... Qb6
(-1.11) Upgrade to see line
12. c3 e5MISTAKE (+2.09) The best move was 12... Be7
(+0.07) Upgrade to see line
13. d5BLUNDER (-2.03) The best move was 13. dxe5
(+2.17) Upgrade to see line
13... Ne7 14. Bc4INACCURACY (-3.38) A better move was 14. Nd2
(-2.05) Upgrade to see line
14... a6INACCURACY (-1.81) A better move was 14... Nf5
(-3.13) Upgrade to see line
15. Qb3MISTAKE (-4.25) The best move was 15. Nd2
(-1.67) Upgrade to see line
15... b5 16. Be2 Qxd5BLUNDER (-2.25) The best move was 16... Nxd5
(-5.51) Upgrade to see line
17. c4 bxc4 18. Bxc4 Qc6 19. Nd2 Be6 20. Rc1INACCURACY (-5.02) A better move was 20. Bxe6
(-2.58) Upgrade to see line
20... Bxc4BLUNDER (-1.16) The best move was 20... exf4
(-5.54) Upgrade to see line
21. Rxc4 Qb5 22. Rb4INACCURACY (-1.29) A better move was 22. Nxe4
(-0.35) Upgrade to see line
22... Qd5INACCURACY (0.00) A better move was 22... Qc6
(-0.91) Upgrade to see line
23. Qxd5INACCURACY (-1.68) A better move was 23. Nxe4
(-0.53) Upgrade to see line
23... Nxd5 24. Rb3MISTAKE (-2.97) The best move was 24. Rxe4
(-1.22) Upgrade to see line
24... Nxe3INACCURACY (-1.93) A better move was 24... Rac8
(-2.89) Upgrade to see line
25. Rxe3 exf4 26. Rxe4 h6INACCURACY (-1.28) A better move was 26... fxg3
(-2.26) Upgrade to see line
27. gxf4
Play may have continued 27... Bxb2


Comments

Post a Comment

Popular posts from this blog

#The Witch meets her nemesis

Sample pgn file for win over Witch bot [Event "Vs. Computer"] [Site "Chess.com"] [Date "2023-09-17"] [White "Witch"] [Black "petrushka_googol"] [Result "0-1"] [TimeControl "-"] [SetUp "1"] [FEN "rnbqknrb/pppppppp/8/8/8/8/PPPPPPPP/RNBQKNRB w GAga - 0 1"] [Variant "Chess960"] [Termination "petrushka_googol won by checkmate"] 1. d4 d5 2. Nc3 e6 3. Qd3 Qf6 4. Nb5 Qe7 5. Qc3 c6 6. Na3 Na6 7. Bd2 Bd7 8. Qe3 g6 9. O-O-O f5 10. g4 O-O-O 11. Kb1 Kb8 12. Qd3 e5 13. g5 e4 14. Qc3 c5 15. Bf Ka8 16. e3 cxd4 17. exd4 Bc6 18. Qe3 Ne6 19. Be5 Bxe5 20. dxe5 Nb4 21. c3 Nd3 22. Rxd3 exd3 23. Qxd3 Nc5 24. Qd4 Na4 25. Nc2 b5 26. f4 Qf7 27. Nb4 Bb7 28. b3 Nb6 29. Ne3 a5 30. Qxb6 axb4 31. cxb4 d4 32. Nc2 Bxh1 33. Rxh1 d3 34. Nd4 d2 35. e6 Qe7 36. Qa6+ Qa7 37. Qc6+ Qb7 38. Qxb7+ Kxb7 39. Nxb5 Kb6 40. Nc3 Rge8 41. Kc2 Rxe6 42. Rb1 Re1 43. Rd1 Rxd1 44. Kxd1 Rd3 45. Na4+ Kb5 46. Nc5 Rh3 47. Kxd2 Rxh2+ 48
Post a Comment
Read more

Chess blogging - Chessbase is back with a bang !

In view of my keen interest in UI for applications and websites, I feel it necessary to promote an investigation of the new play-chess interface on www.chessbase.com . * It is minimalistic * Allows you to play as Guest * Allows you to choose from different time-controls * Allows you to test your skills vis-a-vis opponents from across the globe Have a look at this interface, that is impressive from a UI developers point-of-view, and very conducive for a chess player to test his wits !  Whoa !  😇😇😇
Post a Comment
Read more

B Trees🌲🌳🌴 databases and CHESS☺

Binary trees are a specific version of decision trees that have two nodes,one parent and two children, and this concept is used in database programming with relational databases like SQL server for creating in clustered and non clustered indexes. Alpha beta pruning together with B tree searches makeup the basis of chess programming. I have played a program that reached its thought horizon and then had a bizarre response inspite of  having an advantage of one pawn♟️
Post a Comment
Read more