Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: finding when a move is obvious.

Author: Pat King

Date: 12:36:24 04/14/04

Go up one level in this thread


On April 13, 2004 at 23:50:56, Eric Oldre wrote:

>I was wondering if anyone had any advise for the logic to implement to not use
>all the budgeted time if there is only one move that seems reasonable.

My approach is different from that discussed elsewhere in this thread, but I've
been pleased with the results (not that Zotron is a world beater by any means).
I track what I call the 'practical depth limit' or PDL. If I run out of time, I
make the current best move and decrement the PDL. If I reach the PDL, I make the
current best move and increment the PDL. This doesn't explicitly speed up the
selection of obvious moves, but it seems to work out that way.

>
>Thanks,
>Eric Oldre (new chess programmer)

FWIW

Pat King (perpetual newbie chess programmer)



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.