Aspiration window problem
Moderators: hgm, Rebel, chrisw
-
- Posts: 7220
- Joined: Mon May 27, 2013 10:31 am
Re: Aspiration window problem
I think trouble started when it found an entry in transposition table with value outside of the search window and returning it's best move while not ignoring it.
-
- Posts: 490
- Joined: Tue Feb 04, 2014 12:25 pm
- Full name: Colin Jenkins
Re: Aspiration window problem
http://www.talkchess.com/forum/viewtopic.php?t=63251Henk wrote:I think trouble started when it found an entry in transposition table with value outside of the search window and returning it's best move while that move can not be trusted.
-
- Posts: 7220
- Joined: Mon May 27, 2013 10:31 am
Re: Aspiration window problem
I have to revise my code I guess for now it is too strict.
Also nearby there is the distance to root problem to get correct mate in N scores. So even if it works you may get incorrect mate in N scores because you were not using the corrected distance from root value,
[And another problem is when you should reuse best move from transposition table or use internal iterative deepening to get a first move.]
Also nearby there is the distance to root problem to get correct mate in N scores. So even if it works you may get incorrect mate in N scores because you were not using the corrected distance from root value,
[And another problem is when you should reuse best move from transposition table or use internal iterative deepening to get a first move.]
-
- Posts: 855
- Joined: Sun May 23, 2010 1:32 pm
Re: Aspiration window problem
When you have a move coming from tt use it, when you don't have a move from tt it's time to use iid to get a move.Henk wrote: [And another problem is when you should reuse best move from transposition table or use internal iterative deepening to get a first move.]
-
- Posts: 273
- Joined: Wed Aug 24, 2016 9:49 pm
Re: Aspiration window problem
Do you use iid at every node under this condition ?elcabesa wrote:When you have a move coming from tt use it, when you don't have a move from tt it's time to use iid to get a move.Henk wrote: [And another problem is when you should reuse best move from transposition table or use internal iterative deepening to get a first move.]