Author: Uri Blass
Date: 02:20:44 01/05/03
Go up one level in this thread
On January 04, 2003 at 20:01:53, Omid David Tabibi wrote: >On January 04, 2003 at 19:56:03, Sune Fischer wrote: > >>On January 04, 2003 at 19:30:48, Omid David Tabibi wrote: >> >>>On January 04, 2003 at 19:25:28, Sune Fischer wrote: >>> >>>>On January 04, 2003 at 19:21:31, Omid David Tabibi wrote: >>>> >>>>>For each new idea, there are many potential improvements. If Ed has contributed >>>>>10 new ideas, now there are tens of potential improvements... >>>> >>>>Refinements, not new ideas. >>> >>>Looking from that perspective, have there been any new ideas ever?! For example, >>>MTD(f) is a refinement of NegaScout which is a refinement of PVS which is a >>>refinement of AlphaBeta which is a refinement of MinMax which is a refinement >>>of.... >>> >>>All refinements, no new ideas! >> >>Yes, but the new ideas get smaller and smaller, convergence is inevitable. >>Convergence kills the sport, so let's slow it down a bit :) >> > >Indeed they become more complicated and more technical. A decade ago an average >AI academic could often understand computer chess algorithms, while nowadays if >he reads a recent computer chess publication, he would most probably think he is >reading Chinese! > > >>-S. I believe that there are still a lot of simple ideas that can be productive for chess programs and for programs of other games. I believe that it is possible to be 10 times faster than the commercial programs so I do not think that the new ideas will get smaller. The page of Ed is not chinese and I believe that there are a lot of ideas that are easy to explain. I have hopes that the recapture extension in a similiar way to the way that is explained by Ed will give movei a push forward. I am not sure if I understand it correctly and I think that an example with the values of all the varaibles can be more productive then only a definition. Uri
This page took 0.02 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.