Computer Chess Club Archives

Search

Messages

Subject: Re: Repeatability (questions for Omid)

Author: Dan Andersson

Date: 05:56:45 12/19/02

Go up one level in this thread

There is a paper about alpha-beta conspiracy search. The idea is simple. You use
fractional extensions. And have two depth variables one for each side. Then you
deduct less than a ply based on some criterion. The paper used a sigmoid
function based on the mobility for the side to move. And you continue to search
deeper as long as one of the depth measures is above zero. I really like this
idea. It is easy to implement.

MvH Dan Andersson

• Re: Repeatability (questions for Omid) Gian-Carlo Pascutto 06:39:54 12/20/02
  • Re: Repeatability (questions for Omid) Vincent Diepeveen 15:59:41 12/20/02
    • Re: Repeatability (questions for Omid) Dan Andersson 16:27:29 12/20/02

This page took 0.06 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.