Author: Dieter Buerssner
Date: 12:48:06 02/03/05
Go up one level in this thread
On February 03, 2005 at 07:56:19, Ricardo Gibert wrote: >On February 02, 2005 at 13:25:20, Dieter Buerssner wrote: > >>If anybody with a rather big machine wants to solve this fast, one idea. Use two >>hash tables - one for the pawn endgame positions and one normal. Actually, the >>first one would not be a hash table at all, but more like a TB. About 2 GB of >>memory would be enough. As long as we have a pawn endgame (or when we have one >>again after perhaps a small intermezzo with a Q endgame) we can index all >>possible positions. We have 6 files with pawns. On each file, there can only be >>one pawn or none. So each file has 7 possible states (pawn on 2nd row, 3rd, ... >>7th, no pawn). There are 3612 legal KK positions, so all pawn endgames need >> >>3612 * 7^^6 = 4.2xe8 > >These can't be "all pawn endgames" since a pawn capture of a piece from a pawn >promotion is possible. Ricardo, thanks for pointing out my error. I really did not think of this. But I believe the general reasoning is still ok. Some pawn endgames resulting from the wild7 position cannot stored in this scheme. I guess, there will be few with practical relevance, and they can be stored in the classical HT anyway. Regards, Dieter
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.