Author: Uri Blass
Date: 07:22:12 04/19/01
Go up one level in this thread
On April 19, 2001 at 09:31:04, Uri Blass wrote: >On April 19, 2001 at 08:55:39, David Rasmussen wrote: > >>On April 18, 2001 at 16:01:06, Uri Blass wrote: >>> >>>I know it but the point is that programs are very fast and every algorithm in >>>chess that is better for deep search is probably better for today's hardware. >>>> >> >>That is simply not true. One example is Enhanced Transposition Cutoff, as I've >>mentioned earlier. ETC will always be an improvement in the long run, since >>you're winning an exponential amount of time by using a constant (but on todays >>systems, large) amount of time. This is often not beneficial on todays system, >>but on a much quicker system, it would be. > >What is the Enhanced Tranposition Cutoff algorithm? > >Uri I see that you said in a previous post: "For example, we would use Enhanced Transposition Cutoff at all nodes." You also talked about heinz scalable search so maybe I should look at his book to understand what you mean. I believe that there are good ideas that can be used to get exponential improvement but I doubt if these ideas cannot be used for today's hardware if you use it in the right way. If you can use an idea for all the nodes then using it only for part of them in the right way is something to think about 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.