Author: Tony Werten
Date: 10:03:55 11/13/01
Go up one level in this thread
On November 13, 2001 at 10:19:46, Robert Hyatt wrote: >On November 13, 2001 at 05:16:10, Tony Werten 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 >> >>Simple math suggests that the table should have 443,247,013,440 entries >>(excluding ep-rights). With 1 byte per position, your memory seems to be less >>than a factor 1000 off. >> >>Tony > > >It is worse than that. The file will have roughly 2^48 _entries_ 8 pieces >with 64 squares each. that is 262 terrabytes. Actually 262 trillion entries >of probably at least two bytes each, so 512 terrabytes roughly. 6 pawns have less positions than 64, the 3 pawns each cannot have different order (pawn on a2,b2=b2,a2), kings have 1806. So total number is 1806*(48!/(45!*3!))*(45!/(3!*42!))=443247013440 Of course the problem of not having subsets stays. Tony > >Pretty big. :)
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.