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 

Poor man's SEE
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions Flat
View previous topic :: View next topic  
Author Message
Michael Sherwin



Joined: 26 May 2006
Posts: 2750
Location: OH, USA

PostPost subject: Re: Poor man's SEE    Posted: Tue Dec 12, 2017 1:12 pm Reply to topic Reply with quote

Yes, the SEE would be expensive. And the very next call to qsearch will find the refutation anyway. Beyond that though if the HxL uncovers a separate LxH that would also be found quickly by the next call to qsearch. So the SEE might return that the first HxL is okay but would be blind to the uncovered LxH resulting in wasted effort. I believe in Bob's axiom, 'don't do anything that you do not have to do and don't do anything you do have to do before you have to do it'. BTW, where is Bob (his last post was in August), do we have to send out a search party? Very Happy
_________________
Regards,
Mike
Back to top
View user's profile Send private message
Display posts from previous:   
Subject Author Date/Time
Poor man's SEE H.G.Muller Mon Dec 11, 2017 10:43 pm
      Re: Poor man's SEE Michael Sherwin Mon Dec 11, 2017 11:11 pm
            Re: Poor man's SEE H.G.Muller Tue Dec 12, 2017 11:56 am
                  Re: Poor man's SEE Michael Sherwin Tue Dec 12, 2017 1:12 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