Author: Uri Blass
Date: 01:28:12 11/13/01
Go up one level in this thread
On November 13, 2001 at 04:07:15, Gian-Carlo Pascutto wrote: >On November 13, 2001 at 03:22:13, derrick gatewood wrote: > >>How much time and space would it take to compile the tablebase for an endgame >>where each side had 3 pawns? would this be possible or it simple to large? It >>seems like it would be so large since pawns dont have much movement. Has this >>already been performed so I dont have to waste my time? The "Little Game" as it >>is called on chess.net is my nemesis and I really want to figure out this game >>and that tablebase would be all I would need to study it in depth. Thank you.. >>as far as time goes, my system is 1.575 ghz athlon, with 512 megs of PC2100 >>ram > >You need all promotion and minor cases if you want a KPPPKPPP tablebase. Note that I believe that it is possible to build not correct tablebases that are probably correct in 99.99% of the cases if you assume that only promotion to a queen is legal in building the tablebases. It is not going to help building the KPPP vs KPPP but it can help to build KPP vs KPP tablebases that are not 100% correct in the near future. Inspite of the fact that these KPP vs KPP are not going to be correct in 100% of the cases I believe that they can be productive in analysis and maybe even productive for the rating of programs that use them. Uri
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.