ChessUSA.com TalkChess.com
Hosted by Your Move Chess & Games
 
 FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister 
 ProfileProfile   Log in to check your private messagesLog in to check your private messages   Log inLog in 

TT in Qsearch
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions Flat
View previous topic :: View next topic  
Author Message
Jon Dart



Joined: 10 Mar 2006
Posts: 3349
Location: http://www.arasanchess.org

PostPost subject: Re: TT in Qsearch    Posted: Tue Dec 05, 2017 1:50 am Reply to topic Reply with quote

There is a tradeoff. Since there are a huge number of qsearch nodes, using the hash table in the qsearch can be expensive and can cause a lot of memory contention as multiple threads try to access the shared hash table. On the other hand, every time you get a hit you save possibly all of the searching from that node or at least the move generation (because you either get a cutoff, or will get a hash move to try first and it may cause cutoff).

--Jon
Back to top
View user's profile Send private message
Display posts from previous:   
Subject Author Date/Time
TT in Qsearch laurie tunnicliffe Tue Dec 05, 2017 1:27 am
      Re: TT in Qsearch Jon Dart Tue Dec 05, 2017 1:50 am
            Re: TT in Qsearch laurie tunnicliffe Tue Dec 05, 2017 6:13 am
                  Re: TT in Qsearch Nguyen Pham Tue Dec 05, 2017 6:55 am
      Re: TT in Qsearch Tamás Kuzmics Tue Dec 05, 2017 12:41 pm
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum




Powered by phpBB © 2001, 2005 phpBB Group
Enhanced with Moby Threads