Computer Chess Club Archives

Search

Messages

Subject: Re: about search space, state space, and moore's law

Author: martin fierz

Date: 13:07:15 11/04/02

Go up one level in this thread

On November 04, 2002 at 13:08:13, Dan Andersson wrote:

>But there was an option of having some hash there. And even if it was
>impossible. Near perfect move ordering can be achieved anyway. Half depth search
>and heuristics does it well. Deep tactics will be missed, but it would probably
>be missed in any case.
>
>MvH Dan Andersson

hash is not an option because if you want to search trillions of nodes/sec, you
cannot wait for a slow memory read...

aloha
  martin

• Re: about search space, state space, and moore's law Dan Andersson 14:12:18 11/04/02
• Re: about search space, state space, and moore's law Uri Blass 13:49:13 11/04/02

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.