Computer Chess Club Archives

Search

Messages

Subject: Re: mtd/pvs hybrid?

Author: Pat King

Date: 11:37:34 08/27/01

Go up one level in this thread

On August 27, 2001 at 12:51:45, Dan Andersson wrote:

>MTD(f) is already doing the same work as PV-NegaScout, when using plain
>ab-search. So I think you would be introducing a *lot* of overhead into your
>search. You would do better to fix the hash related problem.
>
>MvH Dan Andersson

I wasn't planning on doing straight pvs exactly. Any re-searches would come from
mtd, all min-window. Rather, i was thinking of using the move pv[][] structure
that many pvs implementations use for my move ordering in place of the hash
table, or to supplement it.

Pat

• Re: mtd/pvs hybrid? Gian-Carlo Pascutto 13:01:56 08/27/01
  • Re: mtd/pvs hybrid? Dan Andersson 13:35:10 08/27/01
    • Re: mtd/pvs hybrid? Pat King 14:02:47 08/27/01
      • Re: mtd/pvs hybrid? Dan Andersson 14:24:55 08/27/01

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.