Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Mobility in Chess Evaluation Function at terminal-nodes

Author: Maurizio Monge

Date: 08:21:10 12/29/05

Go up one level in this thread


>
>...but I don't know if he is using it.  For some reason there is a history of
>misdirection on this topic.  IIRC, some microcomputer program authors in the
>80's dropped hints that they were using conspiracy numbers, at least near
>evaluation endpoints; I think Kittinger used the term "nodulations".  But there
>is nothing in the open literature supporting this and later academic authors
>came to the conclusion that conspiracy numbers didn't really work for chess.
>David McAllester and Deniz Yuret finally published their revised work
>(Alpha-Beta-Conspiracy Search. ICGA Journal, Vol. 25, No. 1 (March 2002),
>pp.16-35), nearly ten years after their initial experiments with the
>multiprocessor program Star-Socrates.  I mentioned all this in an old post
>lamenting the lack of recent published work on different search paradigms:
>
>     http://hornid.com/cgi-bin/ccc/topic_show.pl?pid=286391#pid286391
>
>If you can get any variety of conspiracy numbers to work for chess, please
>publish your results!  You can post your preliminary experiments here!  :)
>
>-Walter

Yup, thanks for your answer!
Some day, when i'll have time, i will really try
to do a few experiments with CNS, and should i succede
i will let you know for sure :)

Ciao
Maurizio



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.