Author: Dann Corbit
Date: 22:57:06 10/29/99
Go up one level in this thread
On October 30, 1999 at 01:37:17, Will Singleton wrote:
[snip]
>Fair enough. So, will you be crediting them as co-authors? Is Crafty now a
>collaborative project, not a program by Robert Hyatt? If these contributions
>are significant, you must relinquish sole authorship. And if your goal is to
>advance the science, rather than crafty by itself, I'd think that would be a
>natural thing to do.
He has always given credit where credit is due. Here, for instance, is a
contribution by Eugene Nalimov in version 9.6 of the tool, that has been
documented in file main.c:
9.6 legal move test re-inserted in Search() since null-moves could
make it overlook the fact that a move was illegal. new assembly
code for X86 improves performance about 1/3, very similarly to
the results obtained with the sparc-20 assembly code. this was
contributed by Eugene Nalimov and is a welcome addition.
There are several other places where he specifically mentions the work of
others.
I don't know if that makes Eugene a co-author, even though the egtb.cpp code is
100% Eugene. I think you have to ask both gentlemen about it.
Here is a fragment from a header file of something I wrote:
/*****************************************************************
This C++ template is explicitly donated to the public domain by
Dann Corbit and SolutionsIQ
******************************************************************/
//===========================================================================
// Skiplist implementation
// Written in 1997 by Danniel R. Corbit for SolutionsIQ
//
// Skip Lists are a probabilistic alternative to balanced trees, as
// described in the June 1990 issue of CACM and were invented by
// William Pugh in 1987.
//
// Skip lists are balanced by consulting a random number generator.
// Though skip lists have bad worst-case performance, no input sequence
// consistently produces the worst-case performance (much like quicksort
// when the pivot element is chosen randomly). It is very unlikely a skip
// list data structure will be significantly unbalanced (e.g., for a
// dictionary of more than 250 elements, the chance that a search will take
// more than 3 times the expected time is less than one in a million). Skip
// lists have balance properties similar to that of search trees built by
// random insertions, yet do not require insertions to be random.
// Balancing a data structure probabilistically is easier than
// explicitly maintaining the balance. For many applications, skip lists
// are a more natural representation than trees, also leading to simpler
// algorithms. The simplicity of skip list algorithms makes them easier to
// implement and provides significant constant factor speed improvements
// over balanced tree and self-adjusting tree algorithms. Skip lists are
// also very space efficient. They can easily be configured to require an
// average of 1 1/3 pointers per element (or even less) and do not require
// balance or priority information to be stored with each node.
//
// A Postscript version of Mr. Pugh's report is available via anonymous ftp
// from mimsy.cs.umd.edu.
//
// The author can be contacted at pugh@cs.umd.edu.
//
// Concepts were used from skiplist implementations done by the following:
// Mike Lijewski, lijewski@rosserv.gsfc.nasa.gov
// James E. Pitkow, pitkow@aries.colorado.edu
//
// Future enhancements may be based on ideas from:
// Bobby C. Lee, bobbylee@cs.stanford.edu
// Grant Glouser, glouser@cs.stanford.edu
// Frank Guinan, guinan@cs.stanford.edu
// Sophia Heeyoun Sung, heeyoun@cs.stanford.edu
// At Stanford University
//===========================================================================
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.