Author: Nathan Thom
Date: 16:14:42 02/02/03
Go up one level in this thread
On February 02, 2003 at 12:49:06, Joshua Haglund wrote:
>Hi Everyone!
>
>I need some help with an algorithm.
>
>Want I want to do is this:
>
>for every 5- 10 seconds I want to return a ply
>
>for(time > 1 && time < 10) {
>if {time = 10)
>return ply;
>
>With this ply I want to add it to the current PV_PLIES
>
>so. example:
>
>your pv might be...
>
>e2e4 c7c5 g1f3.... then I want to add the the next move, hopefully the best
>move.. so say it would be
>e2e4 c7c5 g1f3 b8c6 (after the returned ply).
>
>Here's where I get lost.
>
>after returning the ply I want to search again for those 5-10 seconds and return
>that ply
>BUT NOT to make make a move but just to add it too the PV_PLIES.
>
>maybe something like this:
>
>ply PV
>1 e2e4 e7e5 g1f3
>2 e2e4 e7e5 g1f3 b8c6
>3 e2e4 e7e5 g1f3 b8c6 f1b5
>
>each of the "ending moves" of each ply will be the result of the 5- 10 second
>search of the evaluation score.
>
>Either Best_move || Best_score;
>
>Overall this is a restriction of the time searched for each ply.
>Adding plies to gain depth is what I'm trying develop based on the 5-10 second
>evaluation result.
>
>I need some ideas of an algorithm for this.
>
>Any suggestions and help will greatly admired!
>
>Thanks!!
>
>Joshua
>toneewa@yahoo.com
>
>P.S.> I think if people used this in some manner it would greatly help there
>program
id be interested if you make any headway with this idea. it sounds a bit too
dangerous to me.
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.