Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fail-low pruning

Author: Dann Corbit

Date: 09:15:26 01/18/06

Go up one level in this thread


On January 18, 2006 at 11:34:42, Stuart Cracraft wrote:

>On January 17, 2006 at 19:06:25, Dann Corbit wrote:
>
>>On January 17, 2006 at 18:27:05, Stuart Cracraft wrote:
>>
>>>On January 17, 2006 at 17:47:56, Tord Romstad wrote:
>>>
>>>
>>>>"Fail-low pruning" was a new name to me, but it is not a bad name.
>>>>The technique was not invented by me, although I like to think that
>>>>I played some role in popularising it.
>>>
>>>Tord - can you provide some generalized pseudo-code showing what it is?
>>>
>>>I use a basic PVS searcher I stole out of a very old Tony Marsland article
>>>but would be willing to try a switch if you think fail-low pruning is better
>>>than PVS.
>>
>>It is still a pvs search.
>>
>>It just uses a special technique to avoid spending too much time in crappy
>>branches.
>
>I need to look into that - anyone have a URL that explains the technique
>with pseudo-code? Particularly helpful would be a PVS implementation.

Tord's program is open source, and easy to read.



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.