Author: José de Jesús García Ruvalcaba
Date: 09:48:55 06/01/99
Go up one level in this thread
On June 01, 1999 at 00:08:55, alfred palang wrote: >Regarding Ken's database, I really don't have any idea on how it works. Does it >do the following:1) put down your desired endgame formation and play against the >program? 2) evoke analysis from its database and comes up with positions >identical or close to your desired endgame? 3) If so, how strong is it if it >plays against you in the endgame, or it doesn't have this feature except to just >sort out endgames in its database and present it to you for evaluation? How >good of a weapon is this for a chess player who had an adjourned game in a >tournament? I have several questions regarding this program. Please educate me >on these matters. I believe this program is an important tool for any chess >player. What intrigue me about it was Kasparov's comments regarding it during >his lectures in Oregon. Anyone who is acquainted with the program, please be >kind to this serious inquiry. Thanks. I also do not know how Thompson's database works by itself. I recommend Nalimov's tablebases, their advantages are: a. They are more complete. b. They can be probed during the search by some programs, and I expect to see more programs enabling them in the future. c. They are free for download at crafty's ftp site. With crafty using Nalimov tablebases, you can do you (1) easily for 4-men endgames and for 5-men endgames in which one side has three pieces and the other one has two. I do not understand exactly what you mean by (2). And for (3), crafty using the full Nalimov tablebases is extremely strong in simplified endgames, and will play perfectly as soon as it solves the position. I had a lot of adjournments when I was an active player. Computers at that time were weak, so they were a waste of time for adjournment analysis. But I consulted endgame books, specifically Averbakh's series and they were helpful when a simple ending could be reached. I imagine that any set of tablebases, be it Nalimov's or Thompson's, would be even more helpful. José.
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.