Author: J. Wesley Cleveland
Date: 11:32:38 11/13/01
Go up one level in this thread
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 Is the starting positions of the pawns fixed ? E.g. for [D]4k3/ppp5/8/8/8/8/5PPP/4K3 w - - 0 1 the number of possible positions with KPPPkppp is around 100 million while [D] 4k3/5ppp/8/8/8/8/5PPP/4K3 w - - 0 1 is around 10 million. The number of positions with promoted pieces does become _very_ large.
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.