Author: Ian Osgood
Date: 18:22:36 01/07/00
Go up one level in this thread
On January 07, 2000 at 15:39:02, Dann Corbit wrote:
>On January 07, 2000 at 15:05:09, Ian Osgood wrote:
>[snip]
>>Thank you very much, for the link and for the Windows port! This is an ideal
>>starting point for me.
>>
>>Do you know much about the technology used in Chest?
>
>It's very portable ANSI C. All the source is included. Well written, too.
>
>> Which source would I
>>modify to restrict a helpmate solution condition even further (NxR at move 5)?
>
>I suspect that Heiner Marxen would be the person to ask. I have created module
>diagrams and done a bit of study because I want to understand it, but I am not
>the author and might lead you astray.
Well, I did figure it out (I believe), but helpmates are not supported as nicely
as other types of problems (no specialized pruning). Putting in performance
metrics, I found that it was searching 4x more slowly than the full-width
version of TSCP I had cobbled together.
(Oh, I found another bug reading FEN ('F') tags. The inner while loop in
grok_fen() should read while (*ip && !IS_SPACE(*ip)) {... )
I'm not sure I'd agree that it was well written (for maintainance, that is; it
seems pretty heavily performance tuned).
I'm still looking for public source for other search techniques, such as
proof-number search.
IanO
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.