Search found 827 matches

by Zenmastur
Wed Oct 15, 2014 5:31 am
Forum: Computer Chess Club: General Topics
Topic: Some notes about openings!
Replies: 40
Views: 7791

Re: Some notes about openings!

Hello Forrest, Thanks...and good points...! About current issue, Note that Perfect 2015's lines are based mainly on Perfect 2014t book That means mostly of the lines are belonging to GMs openings !) But this is also true that, P2015 book includes many strong engine openings.... And here is just one...
by Zenmastur
Tue Oct 14, 2014 8:16 am
Forum: Computer Chess Club: General Topics
Topic: Some notes about openings!
Replies: 40
Views: 7791

Re: Some notes about openings!

Hello Friends, ...Note that I've changed my mind...and for the future, I don't plan to create anymore engine opening books by GMs games! Because GMs games winning percentage are not same as Top chess engines ! In this way...I believe the book's openings are easier to optimize !! . Sedat, With all d...
by Zenmastur
Fri Oct 10, 2014 10:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Namilove 6 men complete EGTB (torrent)? Interest
Replies: 1
Views: 612

Re: Namilove 6 men complete EGTB (torrent)? Interest

I already have a copy, but I'm wondering why you are using torrents. I found that eMule is much faster if you have a good internet connection. It took me about three-four weeks to down load the entire set. In return, I have kept my emule running with this set loaded most of the time. I don't limit t...
by Zenmastur
Thu Oct 09, 2014 7:26 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Can someone explain what advantage there is to...
Replies: 35
Views: 5903

Re: When the whole key is stored

Not sure why you would need a TT to calculate perft, but if you do need one, perft(8) has ~40% chance of having a collision with a 64-bit key. Perft(13) will have a collision rate of about 0.1. Having 10% of your entries over-written doesn't sound like a usable system to me! :lol: I don't think tha...
by Zenmastur
Thu Oct 09, 2014 6:51 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Stockfish max seldepth
Replies: 8
Views: 1575

Re: Stockfish max seldepth

I think it is even simpler. snip.. snip.. I'm not so sure that's true. snip .. snip Regards, Forrest Regards. Note that stockfish does a lot of pruning so there is a difference between iteration 120 and ply 120.(stockfish limit both of them by the same constant const int MAX_PLY = 120;) 121 is prac...
by Zenmastur
Thu Oct 09, 2014 1:00 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Stockfish max seldepth
Replies: 8
Views: 1575

Re: Stockfish max seldepth

I think it is even simpler. NO chess program has any business searching out to 120 plies and deeper. There is so much error in the search when it is tuned to reach those depths, that such scores that get backed up will never actually be seen anyway. In general, these limits are set to avoid segfaul...
by Zenmastur
Thu Oct 09, 2014 12:28 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Can someone explain what advantage there is to...
Replies: 35
Views: 5903

Re: When the whole key is stored

Not sure why you would need a TT to calculate perft, but if you do need one, perft(8) has ~40% chance of having a collision with a 64-bit key. Perft(13) will have a collision rate of about 0.1. Having 10% of your entries over-written doesn't sound like a usable system to me! :lol: I don't think tha...
by Zenmastur
Wed Oct 08, 2014 2:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Can someone explain what advantage there is to...
Replies: 35
Views: 5903

Re: When the whole key is stored

Symbolic's default book has 481,583 entries. Hmmm... Sounds like a pretty loose book to me but this is off topic so... Collisions happen all the time. They aren't much of a problem. False positive matches can be a problem, and this problem is greatly mitigated by long signatures. Symbolic (and Osca...
by Zenmastur
Tue Oct 07, 2014 9:34 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Can someone explain what advantage there is to...
Replies: 35
Views: 5903

Re: When the whole key is stored

It's not necessary that the length of a transposition table be a power of two. Another approach is to have the entry count of the table be some prime p and the address of an entry given by the value key mod p . For some years now, the cost of a division isn't much different than the cost of a mask ...
by Zenmastur
Tue Oct 07, 2014 9:26 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Can someone explain what advantage there is to...
Replies: 35
Views: 5903

Re: When the whole key is stored

That I could understand if most chess programs were written in Lisp OR they had dynamically re-sizeable TT. Most don't. "Most" ≠ "All" The number of signature bits recoverable from a table entry given its contents and its address governs the false positive rate when all other factors are held...