Author: Oliver Roese
Date: 20:36:49 05/30/00
Go up one level in this thread
On May 30, 2000 at 17:49:05, Robert Hyatt wrote: >On May 30, 2000 at 12:35:50, Oliver Roese wrote: > >>On May 30, 2000 at 10:25:45, Robert Hyatt wrote: >> >>>On May 30, 2000 at 06:55:59, Ray MacFadyen wrote: >>> >>>>Due to my kids filling up my harddisks with games and music I have limited space >>>>in my computers so I cant download the full range of table bases,does anyone >>>>know which are the most commonly used tablebases ? >>>>Any answers will be appreciated. >>>>Thanks in anticipation >>>>Ray MacFadyen >>> >>>You should get all the 3/4 piece files. These total less than 200mb. To that, >>>add kr*kr where *=pnbrq. That will get you close to 1 gig total. If you have >>>more space, I would grab 'sets' with a "p" in them, as I suggested for krp vs >>>kr. >>> >>>ie kbpkb, kbpkn, knpkb, knpkn and so forth. Don't forget the promotion cases >>>if you want optimal play... >> >>BTW you are there... >>The last time i visited your site, i found two versions of each database, one >>for each color to move in a given position. >>Isnt it so that no one really needs both tables, since a simple 1-ply search >>would always be sufficient to restore all values needed, or what? >>Thank you for your patience. >> >>Oliver Roese > > >No. The same position can be reached with either side to move. There are many >zugzwang positions where making the wrong move loses. If you don't have the >right file, then you make a mistake. I never suggested to treat a position as if the other side were to move. ButI see now, you are right in general. If only tables for one side are present, errors could occur at leaf nodes (if not a "table-base-extension" would be triggerd.) This may result in wrong evaluations of "borderlinepositions". But the values for positions, coverd in the table should be there. This was the case i had in mind. Oliver Roese
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.