Author: Vincent Vega
Date: 21:46:19 02/15/00
Go up one level in this thread
On February 15, 2000 at 03:17:05, blass uri wrote: >On February 15, 2000 at 01:57:10, Vincent Vega wrote: > ><snipped> >>The same problem still exists. Knowledge isn't free, it reduces program's speed >>and therefore its ability to look deep. That's not just a theoretical issue, >>it's a real problem. > >No,knowledge sometimes does not reduce program's ability to look deep because >knowledge include also knowledge which lines to search. Of course. But notice that in a previous message Albert Silver wanted to discuss a hypothetical situation with two versions that have equal branching factors. Then this kind of knowledge wouldn't be "allowed." Here, I went along with it. I realize that this is a bad assumption and I stated my concern with comparing programs based on plies alone in another previous message.
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.