Author: Uri Blass
Date: 11:23:31 09/02/03
Go up one level in this thread
On September 02, 2003 at 14:05:07, Richard Patterson wrote: >On September 02, 2003 at 13:47:25, Uri Blass wrote: > >>On September 02, 2003 at 10:36:55, Richard Patterson wrote: >> >>>In this position Fritz 8 analysis took 8 minutes to find RD1-G1 but the move >>>score was not much different than the other two best moves QA7-C7 or RD1xD7. >> >>If you want Fritz or any other program to find the best move as fast as possible >>than you should not give it more than one option. >> >>If it has to calculate second best and third best then it has to do more work >>and becomes slower. >> >>Another point is that without knowing your hardware and the number of nodes per >>second comparison with other programs is meaningless. > > > >> >> >> >> The >>>analysis was not much different 22 minutes with RD1-G1 still leading by .70 over >>>the other moves. The analysis at 30+ minutes gave RD1-G1 (+30.38) a decisive >>>advantage over moves #2 QA7-C7 (+16.06) and #3 RD1xD7 (+15.34). >>> >>>How does your favorite chess program see this position. >> >>I guess that chessmaster can see forced mates. >>Fritz is not the best program in finding forced mate and your positions are >>unimportant for testing playing strength. > > >Hi Uri, > >My hardware is Pentium 4 2.66 w/ 533 FSB. I did the infinite analysis mode in >Fritz 8. Sorry I do not know how to limit which moves fritz can look at. I usually get one option with infinite analysis. clicking + increase the number of option by 1 when clicking - reduce it by one. I was >at 1125kn's average. Could you help me with positions that are important for >testing playing strength. I am new at this and would like to post positions but >only ones that are useful to others. If I can understand then that is half the >battle :>) >Thanks for your time. I think that interesting positions is positions when there is no clear win for one side by many moves. 1)Here is a position that did not happen in my correspondence game but could happen [D]3r1rk1/pp4pp/1n3p2/4pN2/7Q/b1P1B3/Pq3PPP/R4RK1 w - - 0 20 How much time does your program need to find Bh6 with a draw? Here is a position from one of my correspondence games(my opponet resigned after 44...Rc1+). 2)It may be interesting to see how much time programs need to find 26.Rh3(I believe that 26.Rxh5 was the losing move of white inspite of the fact that white's position is not good even after 26.Rh3) I suspect that programs may need at least some hours. [D]5krr/1b2qp2/pp1ppp2/2n2Pbp/P1RNP2R/2N2BP1/2P1Q2P/7K w - - 0 26 I also post the full game [Event "20'/40"] [Site "Tel-Aviv"] [Date "2003.08.25"] [Round "?"] [White "Manuel vega"] [Black "Uri Blass"] [Result "*"] [ECO "B97"] [Annotator "Blass,Uri"] [PlyCount "88"] [TimeControl "40/1200:0"] 1. e4 c5 2. Nf3 d6 3. d4 cxd4 4. Nxd4 Nf6 5. Nc3 a6 6. Bg5 e6 7. f4 Qb6 8. Qd2 Qxb2 9. Rb1 Qa3 10. Bxf6 gxf6 11. Be2 h5 12. O-O Nd7 13. Kh1 Qc5 14. a4 b6 15. Rf3 Bb7 16. Rd3 Qc7 17. Rh3 Ke7 18. Rb4 Bh6 19. Qe3 Rag8 20. Rc4 Nc5 21. Bf3 Kf8 22. Rh4 Qe7 23. g3 Bg7 24. f5 Bh6 25. Qe2 Bg5 26. Rxh5 Rxh5 27. Bxh5 d5 28. exd5 exd5 29. Qxe7+ Kxe7 30. Rb4 Bd2 31. Rxb6 Bxc3 32. Nb3 d4+ 33. Kg1 Bd5 34. Nxc5 d3 35. cxd3 Bd4+ 36. Kf1 Bxc5 37. Rb2 Rg5 38. g4 Rg8 39. Ke2 Kd6 40. Kd2 Re8 41. Kc3 Re1 42. Rb8 Ke7 43. h3 Ra1 44. Rc8 Rc1+ * Uri
This page took 0 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.