Author: Uri Blass
Date: 07:51:58 11/16/00
Go up one level in this thread
On November 16, 2000 at 09:07:23, walter irvin wrote: >to me programs fall into 2 list bean counters and knowledge based . >bean counters >fritz >junior >nimzo >lg2000a > >knowledge based >shredder >hiarcs >rebel >tiger >diep >crafty >king > >now you would think that the knowledge based programs would destroy bean >counters .but that is usually not the case .bean counters are some of the best >and strongest .which makes me wonder if trying to put so much knowledge in a >program really makes it better .i think that depth of search would count for >more than knowledge . I am not sure if the programs that you call knoweldge based have better evaluation function. Using the nodes per second to define which program has more knowledge is not a good idea. It is better to use test positions when knowledge can help programs to see a good move in a short time when programs cannot see the good move by tactics because the material loss is too deep. 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.