Author: ShredderX
Date: 16:33:00 06/22/99
Go up one level in this thread
This is a portion of an "interview" I did with Stefan for the Shredder 3 website. I will update the website with the entire interview and also the games and news from WCC as soon as I can. Here is the segment: Shredder is like all the other successful programs a brute force searcher using the alpha beta search algorithm. Nevertheless I try to implement as much chess knowledge as possible, this is why it is rather slow. On my PII-450 it searches about 100-160 knps in a typical middlegame positon. Compared to some other programs this is not very much, but due to some sophisticated pruning techniques it also reaches a reasonable search depth. I don't use bitboards for move generation or evaluation, I only have some of them for dealing with pawn structures. On June 22, 1999 at 18:11:47, Pete Galati wrote: >On June 22, 1999 at 17:50:21, Dann Corbit wrote: > >>Now that you have sliced through the competition like some razor edged kitchen >>utensil, inquiring minds want to know about Shredder. >> >>Is it a fast searcher? A slow searcher? >>Is it written in C/C++/Assembly? >>Is it knowlege based? > >The ICCA page says "Shredder is written in ANSI-C" not much else. I would have >enjoyed looking over there and finding out that it was written in assembler. > >> >>Does it learn? >>Anything you can reveal would be met with great interest. Some others may have >>extensive knowlege about Shredder, but I know very little.
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.