Author: Robert Hyatt
Date: 05:53:20 10/18/01
Go up one level in this thread
On October 17, 2001 at 14:27:21, Ian Aston wrote: >On October 17, 2001 at 11:19:46, Robert Hyatt wrote: > >>On October 17, 2001 at 04:04:35, Aaron Gordon wrote: >> >>>AMD (Athlon, Thunderbird, Duron, etc) optimized Crafty v18.12 available here at >>>http://65.10.79.9/crafty/index.html . >>> >>>For those with Pentium 2's or 3's, Celeron's, Pentium 4's, etc it should run >>>fine so don't worry. >> >> >>I should explain that this is a "test version" of Crafty. The main change is >>that it uses the "deep blue" extension limit rather than the old method. > >Does this mean that it can beat Kasparov? :) > At blitz, the _old_ version would do just fine. :) >> >>Old: at any ply in the tree, the extensions could not add up to greater >>than one ply. This means that if white checks black, then the move by >>white would extend 1 ply. If it was also a recapture, the recapture could >>not be done since one ply is the max extension at one ply. >> >>New: Two consecutive plies can not produce more than 2 plies of extensions. >>It "averages" the same of course, but now a check and recapture can both be >>applied if the previous ply had no extension to speak of. >> >>I am looking for feedback to see whether this is better or worse than what I >>was doing before.
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.