Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: 0.05 seconds using PN search...

Author: Dan Andersson

Date: 10:53:39 04/24/01

Go up one level in this thread


I would think he only uses PN search, PN search works best when there is limited
mobility after a move, or there is a heuristic evaluation with high reliability.
'Forced' is such a slippery concept many mating nets are forced checks, but PN
search will have problems with the quiet move like the rook lift, limiting moves
and somesuch unless one has a heuristic of very good accuracy to recommend the
move. There is some other improvements that can be made to shrink the tree even
further.

Regards 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.