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

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

Tomas ♟️Bot pgn

I beat this bot with an ELO of 1200 in Fischer 960 Chess ♟️  [Event "Vs. Computer"] [Site "Chess.com"] [Date "2025-01-28"] [White "petrushka_googol"] [Black "Tomas"] [Result "1-0"] [WhiteElo "400"] [BlackElo "1200"] [TimeControl "-"] [SetUp "1"] [FEN "qrkbbnnr/pppppppp/8/8/8/8/PPPPPPPP/QRKBBNNR w HBhb - 0 1"] [Variant "Chess960"] [Termination "petrushka_googol won by checkmate"] 1. e3 d6 2. Bf3 Bd7 3. Ng3 c5 4. Nh3 Bxh3 5. gxh3 Ba5 6. c3 h5 7. b4 Bc7 8. bxc5 dxc5 9. Nxh5 Nf6 10. Nxg7 Rh7 11. Nf5 e6 12. Ne7+ Kd8 13. O-O-O a6 14. c4 Kxe7 15. Rg1 Rd8 16. d3 Rh6 17. Bg4 Nxg4 18. hxg4 Qb8 19. g5 Rh7 20. Qf6+ Ke8 21. h4 Rd6 22. f4 Rb6 23. Rh1 Ng6 24. h5 Bd8 25. Qc3 Nf8 26. g6 Rb1+ 27. Kd2 Rxd1+ 28. Kxd1 fxg6 29. Rg1 g5 30. Bg3 Be7 31. fxg5 Qd8 32. Be5 Rxh5 33. Bf6 Bxf6 34. gxf6 Rh1 35. Rxh1 Qb6 36. Qc1 Kd8 37. Rh8 e5 38. Rxf8+ Kc7 39. Rf7+ Kc8 40. Re7 Qxf6 41. Re8...
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