Author: Kim Roper Jensen
Date: 08:19:56 03/01/00
I just wondered about what is the strength of a simple computer chess program, by simple i mean that you can have all the 'works' regarding seaching techniques , null move, razoring, hash tables etc. But the only evaluation routine is count of material . My own assumption is that on 'low' searches ( between 1 to 10 plys, or short time controls ) the programs will have little playing strength, but what about longer time controls ?? I have the idea that the speed benefit ( no time consuming eval. ) will give the program, deeper plys so on pure tactical reasons it will not play 'bad' chess ( meaning some really bad positional move ) Thank you Kim Roper
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.