Author: José de Jesús García Ruvalcaba
Date: 09:52:13 04/15/99
Go up one level in this thread
On April 15, 1999 at 12:35:57, Milton Zucker wrote: > >On April 15, 1999 at 09:45:53, Bruce Moreland wrote: > >> >>On April 15, 1999 at 09:34:12, Christophe Theron wrote: >> >>>On April 15, 1999 at 09:27:03, Bruce Moreland wrote: >> >>>>What is "knowledge based" ? >>>> >>>>bruce >>> >>>Good remark, Bruce. Here is another one that has no idea of what he is talking >>>about. >> >>It's an interesting term and I'd like to explore its meaning. I am not trying >>to blast anyone. >> >>The programs that have this term applied to them are either extremely weak >>ancient research programs, or very strong commercial programs that nobody knows >>anything about. >> >>bruce > >I will propose a naive definition of a "knowledge-based" chess program, which I >invite others to knock down. If two programs A and B have the same rating, the >slower program that searches less ply per unit of time is the more "knowledge >based" in the sense that it plays at the same strength as the faster program >without seeing the longer term tactical consequences of its move. Presumably its >decisions are based on more positional knowledge and less on tactical >consequences. >...Milton... Search depth is difficult to measure, because it is not uniform. Some variations are followed much deeper than others, due to prunning and extensions. Also, some programs have "half ply" moves. Junior's depth does not seem comparable to other program's. In fact, I think that a program can have a lot of knowledge to decide which branches to extend and which branches to prune (in contrast with the terms of the evaluation function). José.
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.