Computer Chess Club Archives

Search

Messages

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

Author: martin fierz

Date: 19:58:11 11/03/02

Go up one level in this thread

On November 03, 2002 at 22:00:20, Russell Reagan wrote:

>Hsu said he could probably build a machine that could look at 1 trillion nodes
>per second. That would chew through 10^20 positions in a little over 3 years if
>my math is correct.
>
>Russell

you are assuming that hsu's machine can do things it can't do. it would get it's
huge speed from hardware searches. where you (AFAIK) have no access to the
hashtable - i.e. your move ordering will be worse than usual. besides, the same
goes for deep searches: the longer you search, the less stuff you can put in
your hashtable. which will kill your move ordering again... and 10^20 assumes
*perfect* move ordering.

aloha
  martin

• Re: about search space, state space, and moore's law Dan Andersson 10:08:13 11/04/02
  • Re: about search space, state space, and moore's law martin fierz 13:07:15 11/04/02
    • 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.