Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Anyone for an 'increasing expectation' heuristic?

Author: Francis Monkman

Date: 07:57:07 05/03/99

Go up one level in this thread



On May 03, 1999 at 09:24:49, Andrew Williams wrote:


>I don't have ChessBase, but I think any such feature must be based on doing
>n searches - which should be n times slower. If you ask for the best two moves
>does it take (a little less than) twice as long? Perhaps I'm missing something?
>
>Andrew

I've just run a test, one line and seven lines on a given position. One line
takes
one minute to reach 8-ply, seven lines takes three minutes (these timings are
close
to precise). One factor may be that the ChessBase screen updates are
_incredibly_
fast, quite the fastest I've seen -- and one reason it's a gas to watch! So I
would imagine
the graphics (text) overhead would be considerable, and certainly it's nowhere
near
taking seven times as long.

Francis



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.