Author: Uri Blass
Date: 06:01:32 10/14/01
Go up one level in this thread
On October 14, 2001 at 08:37:05, Eduard Nemeth wrote:
>Hello programers!
>
>Today i played on F7 Server a Computergame, but it was very curios!!
>
>Here first this game:
>
>
>[Event "Wertungspartie, 3m + 0s"]
>[Site "?"]
>[Date "2001.??.??"]
>[Round "?"]
>[White "Fritz6x"]
>[Black "NemoEimi"]
>[WhiteElo "1935"]
>[BlackElo "1935"]
>[ECO "A29"]
>[Result "1/2-1/2"]
>
>1. c4 {0} e5 {0} 2. Nc3 {0} Nf6 {0} 3. Nf3 {0} Nc6 {0}
>4. g3 {0} d5 {3} 5. cxd5 {0} Nxd5 {0} 6. Bg2 {0} Nxc3 {4}
>7. bxc3 {0} e4 {4} 8. Ng1 {0} Bf5 {3} 9. Rb1 {5} Bc5 {14}
>10. Rxb7 {5} Bb6 {3} 11. Qa4 {4} Qd5 {5} 12. g4 {5} Bg6 {4}
>13. f4 {3} f5 {4} 14. gxf5 {1} Bxf5 {2} 15. d3 {3} Qc5 {10}
>16. Bxe4 {0} Qxc3+ {3} 17. Kd1 {9} Bd7 {12} 18. Bg2 {3} Na5
>{4} 19. Qe4+ {4} Kf7 {13} 20. Rxb6 {0} cxb6 {1} 21. Nf3 {3}
>Rhe8 {0} 22. Qd4 {3} Qxd4 {5} 23. Nxd4 {0} Rac8 {2}
>24. Bd5+ {4} Ke7 {3} 25. e4 {1} Nc6 {3} 26. Ba3+ {2} Kd8
>{0} 27. Bxc6 {7} Bxc6 {0} 28. f5 {2} Bd7 {0} 29. Kd2 {3}
>Re5 {0} 30. Bb4 {2} g6 {8} 31. f6 {0} Ke8 {2} 32. Bd6 {1}
>Ra5 {2} 33. a3 {2} Kf7 {2} 34. Rf1 {1} Rh5 {0} 35. Rf2 {3}
>Re8 {0} 36. e5 {2} Rhxe5 {2} 37. Bxe5 {0} Rxe5 {1} 38. Nf3
>{3} Rf5 {2} 39. Ke3 {5} Bc6 {0} 40. Nd4 {2} Rxf2 {3}
>41. Kxf2 {0} Bd7 {2} 42. Nf3 {1} Kxf6 {0} 43. d4 {2} Bc6
>{3} 44. Ne5 {0} Bd5 {2} 45. Ke3 {0} g5 {1} 46. Kd3 {1} h5
>{2} 47. Kc3 {2} g4 {2} 48. Kd2 {2} Kf5 {1} 49. Ke3 {1} h4
>{0} 50. Nd3 {1} g3 {2} 51. hxg3 {0} h3 {1} 52. Nf2 {2} h2
>{3} 53. Kd3 {0} h1=B {1} 54. Kc3 {2} Bhf3 {1} 55. Kd3 {0}
>b5 {1} 56. Kc3 {2} a5 {2} 57. Nd3 {0} Kg4 {2} 58. a4 {2}
>b4+ {1} 59. Nxb4 {0} axb4+ {0} 60. Kxb4 {0} Kxg3 {1} 61. a5
>{0} Kf4 {1} 62. a6 {1} Ke4 {0} 63. Kc5 {0} Kd3 {1} 64. a7
>{0} Bc4 {0} 65. Kb6 {0} Kxd4 {0} 66. Kc7 {0} Ba8 {0}
>67. Kd6 {1} Bcd5 {1} 68. Kd7 {0} Kc5 {0} 69. Kc7 {0} Kb5
>{0} 70. Kb8 {0} Kb6 {1} 71. Kc8 {0} Bdb7+ {0} 72. Kb8 {0}
>Bc6 {0} 73. Kc8 {0} Ka6 {0} 74. Kb8 {1} Bd5 {0} 75. Kc7 {0}
>Bf3 {0} 76. Kb8 {0} Bfc6 {1} 77. Kc7 {0} Bd5 {0} 78. Kb8
>{0} Be4 {1} 79. Kc7 {0} Beb7 {1} 80. Kb8 {0} Bf3 {0}
>81. Kc7 {NemoEimi bietet Remis 0} Bfe4 {1} 82. Kb8 {0} Kb6
>{1} 83. Kc8 {0} Kxa7 {0} 1/2-1/2
>
>
>After move 53. Kd3:
>
>[D]8/p7/1p6/3b1k2/3P4/P2K2P1/5N1p/8 b - -
>
>Black played 53...h1=B :-))))
This is not the first time that I see this kind of mistake.
I suspect that it may be better for practical games if programs stop using brute
force and start to use selective search(not negative extensions but pruning at
the root).
Bishop or Rook promotions are the first candidates to prune at the root.
There are other ways to solve the problem but pruning bishop and rook promotions
at the root seems to be the simplest way.
There is no reason for programmers to work only to do their programs weaker
and I remember more cases when bishop promotion was counter productive than the
opposite case.
Uri
This page took 0.01 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.