Dynamic aspiration window

Discussion of chess software programming and technical issues.

Moderator: Ras

jwes
Posts: 778
Joined: Sat Jul 01, 2006 7:11 am

Re: Dynamic aspiration window

Post by jwes »

One idea is to tune by searching a large number of positions to a fixed depth and picking the values that search the fewest nodes. You could then test the values with games.
Dann Corbit
Posts: 12799
Joined: Wed Mar 08, 2006 8:57 pm
Location: Redmond, WA USA

Re: Dynamic aspiration window

Post by Dann Corbit »

jwes wrote:One idea is to tune by searching a large number of positions to a fixed depth and picking the values that search the fewest nodes. You could then test the values with games.
It is a sort of simulated annealing approach.

A similar idea can be used with test positions to get a feasible starting point for various other parameters and then running games to hone the values to correct values for game play.
Taking ideas is not a vice, it is a virtue. We have another word for this. It is called learning.
But sharing ideas is an even greater virtue. We have another word for this. It is called teaching.
Sergei S. Markoff
Posts: 227
Joined: Mon Sep 12, 2011 11:27 pm
Location: Moscow, Russia

Re: Dynamic aspiration window

Post by Sergei S. Markoff »

Quick look

Image
Image
Image
Image
Image
[/img]
The Force Be With You!