Skip to main content

Engineering a stalemate in Chess 😅

Engineering a stalemate in Chess is really a difficult task especially if you have a lesser number of pieces 😀




[Event "kaslopl vs. petrushka_googol"] [Site "Chess.com"] [Date "2021-07-23"] [White "kaslopl"] [Black "petrushka_googol"] [Result "1/2-1/2"] [WhiteElo "703"] [BlackElo "705"] [TimeControl "standard"] [Termination "Game drawn by stalemate"] 1. e4 e5 2. Qh5 Qf6 3. Nf3 Nc6 4. Bc4 d6 5. d3 g6 6. Qh4 Qxh4 7. Nxh4 Be7 8. Nf3 Bg4 9. O-O a6 10. h3 Bxf3 11. gxf3 Nf6 12. f4 exf4 13. Bxf4 Nd4 14. Re1 Nxc2 15. Nc3 Nxe1 16. Rxe1 O-O 17. Bh6 Rfe8 18. d4 Bf8 19. Bg5 Bg7 20. e5 dxe5 21. dxe5 Nd7 22. e6 Rxe6 23. Bxe6 fxe6 24. Rxe6 Nc5 25. Re7 Bxc3 26. bxc3 Na4 27. c4 Nc3 28. a3 Na4 29. Rxc7 b5 30. Rd7 bxc4 31. Rd8+ Rxd8 32. Bxd8 Nb2 33. f4 c3 34. f5 gxf5 35. Bf6 Nd1 36. Kf1 c2 37. Bg5 Ne3+ 38. Bxe3 a5 39. a4 h5 40. h4 Kf7 41. Ke1 Kf6 42. Kd2 Ke5 43. Kxc2 Ke4 44. Bb6 f4 45. Bxa5 Kf3 46. Kd2 Kg3 47. Bb6 f3 48. Ke1 Kxh4 49. Kf2 Kg4 50. a5 h4 51. a6 h3 52. a7 h2 53. a8=Q h1=Q 54. Qg8+ Kf4 55. Bc7+ Ke4 56. Qg4+ Kd3 57. Qxf3+ Kc2 58. Qxh1 Kd2 59. Qe1+ Kc2 60. Qe3 Kb2 61. Be5+ Kb1 62. Qe2 Kc1 63. Bb2+ Kb1 64. Be5 Kc1 65. Qb2+ Kd1 66. Qd4+ Kc1 67. Qc3+ Kd1 68. Ke3 1/2-1/2

Top post on IndiBlogger, the biggest community of Indian Bloggers




Comments

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 !  😇😇😇

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...

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♟️