Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: ICGA publishing requirements

Author: Robert Hyatt

Date: 13:08:21 11/21/02

Go up one level in this thread


On November 21, 2002 at 08:10:49, Georg v. Zimmermann wrote:

>What are the requirements to publish an artice in that journal ? It doesnt seem
>like you need a strong program to test your results with.
>
>I feel I could have contributed as much to the science community with some of my
>ideas presented in my own weak engine.
>But I can't because I am not a science student/researcher ?
>
>Can someone clarify if the system is as silly as it looks to me.
>


The program doesn't have to be strong.  IE super-glue was discovered
accidentally,
and has still become a standard adhesive in many places.  If an idea works, it
doesn't
necessarily matter whether it was found by diligent research or serendipity.
The fact
that it was found, and is being explained so everyone can use it, it the salient
point.

If you get an idea, the best way to test it is by implementing it in something,
but the
idea is what is important, not what it is implemented in...




>Georg v. Zimmermann
>
>On November 20, 2002 at 11:43:10, Omid David Tabibi wrote:
>
>>
>>            ICGA Journal, Vol. 25, No. 3, pp. 153-161, September 2003
>>
>>
>>                          Verified Null-Move Pruning
>>
>>                    Omid David Tabibi and Nathan S. Netanyahu
>>
>>
>>                                   Abstract
>>
>>In this article we review standard null-move pruning and introduce our extended
>>version of it, which we call verified null-move pruning. In verified null-move
>>pruning, whenever the shallow null-move search indicates a fail-high, instead of
>>cutting off the search from the current node, the search is continued with
>>reduced depth.
>>
>>Our experiments with verified null-move pruning show that on average, it
>>constructs a smaller search tree with greater tactical strength in comparison to
>>standard null-move pruning. Moreover, unlike standard null-move pruning, which
>>fails badly in zugzwang positions, verified null-move pruning manages to detect
>>most zugzwangs and in such cases conducts a re-search to obtain the correct
>>result. In addition, verified null-move pruning is very easy to implement, and
>>any standard null-move pruning program can use verified null-move pruning by
>>modifying only a few lines of code.
>>
>>
>>pdf:  http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.pdf
>>zipped pdf:  http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.pdf.zip
>>gzipped postscript:  http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.ps.gz



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