Author: Uri Blass
Date: 01:34:42 05/31/03
Go up one level in this thread
On May 31, 2003 at 01:05:14, Pavel Blokhine wrote: > > >Here is the analysis from the three different engines of Deep junior 8 with a >1000 MB of Hash after 5 minutes of analysis each. >Deep Junior 8: > >rnbqr1k1/pp3ppp/2pb1n2/3p4/3P4/P1NBP3/1PQ1NPPP/R1B2RK1 b - - 0 1 > >Analysis by Deep Junior 8: > >1. = (0.18): 10...Nb8-d7 11.Bc1-d2 Nd7-b6 12.h2-h3 Qd8-e7 13.Ne2-f4 Nb6-c4 >14.Ra1-d1 Nc4xd2 15.Rd1xd2 >2. = (0.19): 10...g7-g6 11.Bc1-d2 a7-a6 12.Ne2-f4 >3. = (0.21): 10...h7-h6 11.Ne2-g3 >4. = (0.21): 10...Qd8-e7 11.f2-f3 Qe7-c7 >5. = (0.21): 10...b7-b5 11.Ne2-f4 >6. = (0.21): 10...a7-a6 11.Ne2-f4 >7. = (0.21): 10...a7-a5 11.Bc1-d2 >8. ² (0.26): 10...b7-b6 11.Bc1-d2 Bc8-a6 12.Ne2-g3 Ba6xd3 13.Qc2xd3 Bd6xg3 >14.f2xg3 Nb8-d7 15.Qd3-f5 Qd8-e7 >9. ² (0.30): 10...h7-h5 11.f2-f3 Qd8-c7 >10. = (0.21): 10...Qd8-c7 11.Ne2-g3 Qc7-e7 >11. ² (0.29): 10...Nb8-a6 11.Bc1-d2 >12. ² (0.35): 10...Bc8-e6 11.f2-f4 >13. ² (0.35): 10...Bc8-d7 11.h2-h3 >14. ² (0.39): 10...Kg8-h8 11.Ne2-g3 >15. ² (0.41): 10...Bc8-g4 11.Ne2-f4 >16. ² (0.48): 10...Bd6-c7 11.Ne2-g3 >17. ² (0.54): 10...Kg8-f8 11.Bc1-d2 h7-h6 12.Ne2-g3 Qd8-e7 >18. ² (0.54): 10...Nf6-g4 11.Bd3xh7+ >19. ² (0.54): 10...Bd6-e7 11.Ne2-f4 >20. ² (0.67): 10...Bd6-f8 11.e3-e4 >21. ² (0.67): 10...Qd8-d7 11.e3-e4 >22. ² (0.69): 10...Re8-f8 11.Bc1-d2 >23. ± (0.71): 10...Re8-e6 11.Ne2-f4 >24. ± (0.79): 10...Nf6-e4 11.Bd3xe4 >25. ± (0.87): 10...Bd6xh2+ >26. ± (0.94): 10...Nf6-h5 11.e3-e4 g7-g6 >27. ± (0.97): 10...Qd8-a5 11.e3-e4 >28. ± (1.01): 10...Qd8-b6 11.e3-e4 >29. ± (1.01): 10...c6-c5 11.d4xc5 >30. ± (1.01): 10...g7-g5 11.f2-f4 >31. ± (1.09): 10...Nf6-d7 11.Bd3xh7+ >32. ± (1.40): 10...Re8-e7 11.e3-e4 >33. +- (2.43): 10...Re8-e4 >34. +- (2.94): 10...Bc8-h3 11.g2xh3 Qd8-c8 12.Kg1-g2 g7-g6 13.Ne2-g3 Nb8-d7 >14.Bc1-d2 h7-h6 >35. +- (3.13): 10...Bc8-f5 11.Bd3xf5 g7-g6 12.Bf5-d3 Nb8-d7 13.Ne2-f4 Qd8-e7 >14.f2-f3 Ra8-d8 >36. +- (3.20): 10...Bd6xa3 11.b2xa3 >37. +- (3.30): 10...Bd6-b4 11.a3xb4 Nb8-a6 12.Bd3xa6 b7xa6 13.Ne2-f4 Qd8-d6 >14.Bc1-d2 Ra8-b8 15.Nc3-e2 >38. +- (3.49): 10...Bd6-e5 11.d4xe5 Re8xe5 12.b2-b4 a7-a5 13.Bc1-b2 a5xb4 >39. +- (3.83): 10...Bd6-c5 11.d4xc5 b7-b6 12.Nc3-a4 b6-b5 >40. +- (3.97): 10...Bd6-f4 11.e3xf4 Nb8-d7 12.Ne2-g3 g7-g6 13.Bc1-d2 Qd8-b6 >14.Rf1-e1 Re8xe1+ >41. +- (4.06): 10...Bd6-g3 11.Ne2xg3 >42. +- (4.40): 10...Re8-e5 11.d4xe5 Bd6xe5 12.f2-f4 Be5-d6 13.Bc1-d2 Nb8-d7 >14.b2-b4 a7-a5 15.Ne2-d4 >43. +- (4.69): 10...Re8xe3 11.Bc1xe3 g7-g6 12.h2-h3 a7-a5 Why do you make the program slower by giving it so many option. You should let it search deeper by giving it less options(usually I prefer only 1 option(2 may be also acceptable but I see no reason to give it 43 options because it waste too much time on analyzing stupid blunders only to get an exact score for them that is not interesting). 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.