Author: Robert Hyatt
Date: 05:00:00 05/19/98
Go up one level in this thread
On May 18, 1998 at 22:05:07, Robert Henry Durrett wrote: >I noticed a recent post about tablebases, plus also the below query >about this same topic. > >Would someone please tell everybody what tablebases are and whether or >not they play any significant role in modern chess software? Is it not >enough to just have a nice table and good hashtables? If tablebases are >used, what do they offer or "buy you"? > they are large files, that have one entry for every *possible* position of the N pieces on the board. That entry is either "mate in N", "mated in N" or "draw". Based on *perfect* play. they produce interesting effects, including the ability to win *all* winnable KRP vs KR endings and so forth. BTW this is probably the single most common ending I see against other computers... >>Posted by Rickard Björklund on May 18, 1998 at 09:52:07: > >>Hi! > >>I'm wondering about the state-of-art methods for creating tablebases. >>I've done a few chess and awari tablebases myself, but they are pretty >>slow and memory consuming. > >>If I remember right Urban Koistinen posted something some years ago on >>rgcc, but I can't find it on DejaNews. So I'd be glad if someone has >>anything on the ideas behind it or if there are any new interesting >>things to try. > >Rickard
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.