One of the many nice things about Rybka is its support of the 6-piece Nalimov tablebases. Since I use engines entirely for annotation and analysis, I wouldn't think of spending money on an engine that didn't consult the 6-piece bases.
Of the engines out there, it seems only Rybka, Fritz, and Hiarcs use the 6-piece bases. Why is this? I've read that it's not difficult for a programmer to get the code needed to implement the bases. Why haven't the other programmers taken advantage of this?
Vas, if you read this, do you have any thoughts on this?
Bob
Of the engines out there, it seems only Rybka, Fritz, and Hiarcs use the 6-piece bases. Why is this? I've read that it's not difficult for a programmer to get the code needed to implement the bases. Why haven't the other programmers taken advantage of this?
Vas, if you read this, do you have any thoughts on this?
Bob
Hi herakleitos,
Well, that is refreshing to hear!
Well, that is refreshing to hear!
![[us]](/mwf/v12/flags/us.png "United States")
Most of the good engines support them--Shredder, Junior, Spike, some of the Fruits, etc.
Using Nalimov's tablebases requires using his code too (as Vas once mentioned, either 1 or 0 people actually understand this code :-) ). This code is available for inspection as part of the Crafty source. People who want to use it should get Nalimov's permission first.
Alan
Alan
![[hu]](/mwf/v12/flags/hu.png "Hungary")
Nalimov's code automatically supports 6-man TBs. Some people have a problem with Nalimov's license and refuse to use it.
Vas
Vas
This is the answer I was looking for. Thanks.
![[eu]](/mwf/v12/flags/eu.png "Europe")
I thought how to reduce amount of EGTB without loss of informational value. Here are two ways:
1. Simple pruning method stores positions with DTM=ar only (a¢N, r is radius)
2. This method selects important positions with value>min. First in position(i) retract move(j). If move(j) is the best, then position(i).value += abs(shortest_DTM-next_shortest_DTM)
I believe we can compress 4-5-6 pieces on one CD.
Mario
1. Simple pruning method stores positions with DTM=ar only (a¢N, r is radius)
2. This method selects important positions with value>min. First in position(i) retract move(j). If move(j) is the best, then position(i).value += abs(shortest_DTM-next_shortest_DTM)
I believe we can compress 4-5-6 pieces on one CD.
Mario
![[il]](/mwf/v12/flags/il.png "Israel")
I also use engines for analysis but I do not see the tablebases as extremely important.
for knowing if 6 piece tablebases position is drawn or won I can look at the internet and I do not need tablebases and if the root position is not tablebases positions there are other things except tablebases that are important and it is not clear that engine that support tablebases is better.
Uri
for knowing if 6 piece tablebases position is drawn or won I can look at the internet and I do not need tablebases and if the root position is not tablebases positions there are other things except tablebases that are important and it is not clear that engine that support tablebases is better.
Uri
I do not think that you are correct. Just imagine a 7 piece ending , where the program reaches a 6-piece and knows at once what is the result of that ending, it will produce a better analysis of the 7-pieces.
This is right but on the other hand the program may search less deeply because of probing tablebases and miss a win because of not seeing deep enough a line when no pieces are traded.
Uri
Uri
![[kw]](/mwf/v12/flags/kw.png "Kuwait")
The best thing is to have a passive extra machine with full EGTB's that is observing the main engine and will only get involved if it sees a big evaluation jump. This way the main engine will work without EGTB handicap yet still play perfect 6 EGTB endings ... the best of both worlds.
I was talking about analysis and not about playing.
In analysis if I get a 6 piece tablebases position I can simply look at the internet for the right result and right move.
Uri
In analysis if I get a 6 piece tablebases position I can simply look at the internet for the right result and right move.
Uri
Powered by mwForum 2.27.4 © 1999-2012 Markus Wichitill