Author: Uri Blass
Date: 12:15:57 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. You assume that programs probe the tablebases when they get close to the leaves. My assumption is that exactly in these cases programs never probe the tablebases. Implementation that probe the tablebases everywhere is considered by me as wrong implementation and the right implementation without bugs do the search only faster. 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.