Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: About search algorithms and heuristics

Author: Andrew Williams

Date: 07:23:57 05/26/00

Go up one level in this thread


On May 26, 2000 at 09:21:01, Josť Carlos wrote:

>  I'm curious about what search algorithms and heuristics do commercial and
>amateur programs use, for example, null move vs no null move, PVS vs MTD(f) and
>so on.
>  In Averno, I use PVS and AS, and haven't tried null move cause I'm a little
>afraid of losing precision in short tactics, though I see most programs use null
>move.
>  Junior is said not use null move. Do any other of you guys or commecial
>programmers not use null move? If so, what are your reasons?
>  Who of you have tried MTD(f)? Why did you keep/discard it?

PostModernist uses MTD(f). I like it and I'm still discovering new "tricks"
to improve its performance. The main weakness is maintaining a sensible PV.
I use my hash table and on long searches, I lose the end of the PV.

>  What other algorithms/heuristics are you using or did you discard?
>
>  Thanks in advance.
>
>  Josť C.

Andrew



This page took 0 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.