Author: Gian-Carlo Pascutto
Date: 01:07:15 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 You need all promotion and minor cases if you want a KPPPKPPP tablebase. It is not even possible to construct KPPKPP today (I think), so KPPPKPP is certainly outof the question, and KPPPKPPP even worse. The limited movement of the pawns does not help. I believe the game has already been analyzed as a forced win for white (I think by Berliner). 1. Ke2 1-0 -- GCP
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.