Author: Harald Faber
Date: 01:49:30 12/02/01
Go up one level in this thread
On December 02, 2001 at 01:48:03, Uri Blass wrote: >>It is common knowledge of programmers that 12Kb of hash tables is inferior to >>192Mb. >> >>So if the tester wants to use 12Kb of hash table, should the program: >>1) use 12Kb? >>2) refuse to run? >>3) use 192Mb no matter what? > >It is a different case >no user is using 12 kbytes but many users use the incomplete tablebases. > >It is the responsibilities of the testers to give the programs equal conditions >that mean to give them the same tablebases. Be sure that is what we had done. BUT: the TBs had been CONSISTENT TBs and not such a nonsense like endgame-turbo... >It is not the duty of the testers to use the full 5 piece tablebases because it >is possible that there is not enough place in the harddisk for them. > >Uri In times like these where 40GB cost $100-$150 (for more than a year now) I am sure many computer chess maniacs have enough space on their HD to install the complete 5-man TBs. I guess it is more the "how to get them cheaply?" However, you are right, it is not on us testers to find what happens if incomplete TB setup is used. Ido not have the "endgame turrbo" e.g., only the complete TBs. So what should I do? Move some of the 5-mans? Which ones? And then test again? No, this is nonsense. And others won't do that too. I repeat my question, considering that the complete 5-man TBs are available for free download or for little money: Should the programmer implement superfluous code although the TBs solve e.g. the "problem" mating with bishop+knight? Honestly, I would not waste my time or code too implement such a nonsense.
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.