Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dan Andersson

Date: 14:12:18 11/04/02

Go up one level in this thread


A small hash using the same implementation material as the registers should be
possible for the search or PV or refutation table. And even if not possible. The
last hash before hardware could include a PV. The near perfect ordering should
still be possible.

MvH Dan Andersson



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.