Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Playing strength of simple eval programs?

Author: José Carlos

Date: 10:09:30 03/02/00

Go up one level in this thread


On March 01, 2000 at 11:48:39, Colin Frayn wrote:

>>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.>
>
>You're absolutely right.  In fact you'll probably find that it serches fewer
>plies in the same time than a program with a modest but accurate positional
>evaluation function.
>
>Colin

  I don't think so. A program with a very simple evaluation will produce more
cutoffs due equal eval (for example, all moves that don't win/lose material have
the same eval).
  The program would sure be very stupid, but would search deeper than
normal-evaluation programs.

  Just my opinion.

  José C.



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.