Author: Robert Hyatt
Date: 21:09:24 04/13/04
Go up one level in this thread
On April 13, 2004 at 23:50:56, Eric Oldre wrote: >As those who have read my few other posts have heard, I've been working on a new >chess engine project. > >I've made a lot more progress than i've expected, but still have SO far to go. > >In my "Think" function i started with: > >continue with iterative deepening until depth x. > >then improved to search to time X (where X was a reasonable amount of time to >spend for one move give the time situation.) > >finally i changed to my current strategy: >1)figure out a sensible time to budget for this move. >2)keep with iterative deepening until: > a)i don't think i can complete 1 more ply in the time allowed > b)if i still hit the time limit stop unless i'm almost done with that ply > >The flaw with this of course is that my engine will still spend lots of time >searching for a move when the response should be obvious. > >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. Simple idea: a move is "easy" and can be made after using less than the planned time limit if and only if 1. estimated score for first root move is way higher than the second move. IE say 2.00 better. 2. This is a recapture. IE opponent just captured a piece of ours and we are recapturing on the same square. Other types of "easy" moves have higher risk to stop the search early... > >Thanks, >Eric Oldre (new chess programmer)
This page took 0.01 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.