Author: Uri Blass
Date: 01:22:02 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 is too large 7 piece tablebases are too large to build and you need all the other 8 piece tablebases when both sides have 4 pieces in order to build the tablebase that you ask. I can see only special exceptions when it may be easier to build the 8 piece tablebases(cases when the pawns are blocked) and even in these cases you need the 7 piece tablebases because the king can capture pawns. I think that it may be possible to build the tablebases that you ask for in a very specific case when all the pawns are blocked and on the same file it means for example that white has pawns at a2, a3, a4 when black has pawns at a5, a6, a7 It can be also a different file. In this case you do not need to care about promotions because promotion can be possible only if the 3 pawns of one side are captured but in this case the result is known by the KPPP vs K tablebases. The number of relevant position to build is relatively small but unfortunately these tablebases are not very important. 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. I believe that yace with the existing tablebases can find the right move in almost every KPPP vs KPPP endgame by search in a short time. It may be interesting if someone can post a position that it cannot find the right move in an hour on your hardware. 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.