Author: Roy Eassa
Date: 08:09:10 04/25/02
Go up one level in this thread
On April 25, 2002 at 09:57:45, Richard Pijl wrote: > >>It slows down the search only if the implementation has bugs. >> >>Without bugs it should do the search faster because probing the tablebases can >>be done only in cases that not probing them means wasting more time. >> >Not true. At the expense of one tablebase probe you can search many nodes. >Especially when getting close to leaf nodes (or in them) a tablebase probe is >more expensive. Having perfect knowledge is not always useful as most evaluation >functions will correctly evaluate the position to be outside the ab windows. >This will be the most common situation as it deals with unfavourable piece >exchanges and giving away material. > >Richard. Am I the only user who has decided NOT to install tablebases on my computer? For the reasons mentioned above by Richard, plus the fact that tablebases take up a lot of space for very little overall Elo gain, I just let the programs figure out what they can figure out in the time they have, like humans do. (Before you ask, yes I do install opening books because every game uses them and because without them the programs are much weaker than with them.)
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.