Author: Joshua Shriver
Date: 09:40:02 11/22/05
Go up one level in this thread
I did some searching to find out about bitbases and tablebases. BB's seem really nice, though my understanding of TB's is now fuzzy. I thought the whole purpose of a TB was to give you the most optimal moves to mate/draw/loss given any possible position. From what I've read, TB's just tell you the # of moves it takes to get there. If you have a tablebase that says you can win in 100 moves, it's pointless unless you know what those moves are. If anyone can clear this up for me I'd greatly appreciate it. It would seem BB + TB would make a good combination. You could load the BB into memory for quick probing, then if you find a mate you can pull the move list off of the TB's. Josh On November 22, 2005 at 11:57:20, Tord Romstad wrote: >On November 22, 2005 at 11:33:34, Joshua Shriver wrote: > >>Good Morning, >> >> Curious but what is a bitbase? > >A bitbase is similar to a tablebase, but with less information. For each >position, the bitbase says whether the position is won, lost or drawn, but >it does not give the number of moves to mate. > >The advantage of bitbases compared to tablebases is that they are much >smaller. A program can often keep the most fundamental bitbases in RAM, >which makes them very fast to probe. > >Tord
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.