Author: David Mitchell
Date: 13:07:04 12/14/05
Go up one level in this thread
On December 14, 2005 at 15:49:44, Joseph Ciarrochi wrote: >hi folks > >(i hope you will tolerate my simple question. i am not a programer, but am >interested in how chess programs think...I'm a research psychologist) > >With humans, the best blitz players have the most knowledge. This is because >pattern recognition is much faster than deliberate search > >But i get the sense that it might be the opposite for computers? ARe the most >knowledgable programs (e.g., hiarcs) expected to be worse at blitz than ones >that are optimized for searchd depth? I have heard that the key to blitz is >simple search depth? > >Or have i got it all wrong. Is there indeed a trade off between search depth and >knowledge? > > Since we're completely unsure of how a chess master really thinks when playing, I can assure you that the computer chess programs do not "think" at all. They calculate like bats out of hell, though! ;-)) Many things must all work together for a good blitz program. Time management, a good opening book, and fast search/evaluation, are all important. If a program's knowledge impedes it's ability to search & evaluate quickly, or handle it's time well, it will certainly suffer. Like everything else (people, cars, stocks, you name it), some just do better (at shorter time controls, longer time controls, etc.), than others. In general, yes, I think there is a trade-off, but I don't believe there HAS to be a trade-off. It just requires better programming and a lot more work and testing, to leap that hurdle. Dave
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.