Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: KBBK and KBNK endings

Author: Roberto Waldteufel

Date: 13:59:59 06/24/98

Go up one level in this thread



On June 24, 1998 at 11:13:41, Inmann Werner wrote:

>On June 24, 1998 at 10:16:24, Roberto Waldteufel wrote:
>
>>
>>Hi Werner
>>
>>If you peruse the paper by Slate and Atkin on CHESS 4.x, you will find a
>>detailed description of this method, with weighting coefficients for all the
>>factors. I believe this method was invented by them.
>>
>>Best wishes,
>>
>>Roberto
>
>Hello Roberto
>
>where can I get this paper?
>
>Werner

Hi Werner,

I looked through my rather untidy collection and found several copies of the
paper. Its full title is:

Chess 4.5: The Northwestern University Chess Program by David Slate and Larry
Atkin.

It was first published in Peter Frey's excellent, but now very outdated, book
"Chess Skill in Man and Machine" (Springer-Verlag, New York, 1977), pages
82-118. It is also reprinted in David Levy's "Computer Chess Compendium"
(Batsford, London 1988). The section of the paper that is relavent is the part
entitled "mop-up evaluation". I think you will find the rest of the paper very
interesting as well: they describe their general evaluation function in great
detail, as well as their implementation of the recursive alpha-beta algorithm
with various refinements that are nowadays, however, quite commonplace. Their
program was of some historic interest, being as far as I know the first
efficient bute force searching program to play to a high standard in
tournaments.

Best wishes,

Roberto



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.