Author: Tord Romstad
Date: 22:51:53 02/02/04
Go up one level in this thread
On February 02, 2004 at 14:28:27, Robert Hyatt wrote: >Here's a better example: > > 9-> 0.92 -1.44 10. ... O-O 11. h3 Qd7 12. Bc4 e4 13. > Ng5 Ne5 14. Bb5 Qf5 (s=6) > 10 1.18 -1.20 10. ... O-O 11. h3 Qe6 12. Bd3 h6 13. > Nd2 Re8 14. Rhf1 Nd5 15. Bc4 (s=5) > 10 2.41 -1.26 10. ... e4 11. Nb5 exf3 12. Rxd6 cxd6 > 13. Nc7+ Kd8 14. Nxa8 fxg2 15. Bxg2 > Ne4 16. Qf1 Rf8 (s=4) > >Notice after 9, s=6. After searching the first move, s=5. The next move is >also searched with all threads and it replaces the original best, as expected. >Note s=4 as there are still four _more_ moves that might become new best moves, >although in this case it did not happen... Thanks for the great explanation, Bob! Trying to figure out how all this stuff would work with my MTD(f) search already makes my brain hurt. At the moment I am not very interested in parallel search, but I will probably want to have a look at it when I get a dual G5. Tord
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.