Author: blass uri
Date: 08:31:50 03/01/00
Go up one level in this thread
On March 01, 2000 at 11:19:56, Kim Roper Jensen wrote: >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 ) I think that practically it is going to play bad chess. I do not think that you can reject lines like 1.e4 e5 2.Qh5 or 1.c3 e5 2.a3 based on material only evaluation even if you search 20 plies. I do not think that there is a speed benefit about plies because ny intuition tells me that the program is going to have a bad order of moves and the fact that it search more nodes per second is not going to help it to search deeper because the disatvantage from bad order of moves is more important. Uri
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.