Skip to main content

Free Chess Analysis + Bot play

The internet is the sea of wisdom for the avid chess player.

You can play a bot on chesstempo.com and download the PGN.

    Graphic 1



Then import this PGN on lichess.org (does not require you to be registered on the site).

Submit the game for analysis and hey presto... You get Fritz type analysis for free....

    Graphic 2



    Graphic 3



    Graphic 4



HO HUM ☺

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