Page 2 of 2
Re: which technic next to implement?
Posted: Thu Mar 31, 2011 9:41 pm
by smatovic
null-move is not much code. You can do this in 10-20-30 lines depending on how you implement it.
yepp, you and Dann are right, 11 lines of code and + 2 ply depth
thx,
Srdja
Re: which technic next to implement?
Posted: Thu Mar 31, 2011 9:44 pm
by smatovic
Do you store and retrieve the best move from hash?
yes, that works fine.
What exactly did not work about aspiration windows?
i think i implemented it correctly, but there is no decreasement of searched nodes to observe...maybe i have to take care of my PVS implementation with my ID-Framework.
--
Srdja
Re: which technic next to implement?
Posted: Fri Apr 01, 2011 2:48 pm
by marcelk
smatovic wrote:
i think i implemented it correctly, but there is no decreasement of searched nodes to observe...maybe i have to take care of my PVS implementation with my ID-Framework.
That is normal: PVS and aspiration window are both fishing in the same pond. When you already have PVS, the aspiration window will not add as much anymore.
Re: which technic next to implement?
Posted: Fri Apr 01, 2011 2:53 pm
by smatovic
That is normal: PVS and aspiration window are both fishing in the same pond. When you already have PVS, the aspiration window will not add as much anymore.
I understand,
btw: thanks for MSCP, it is a good teacher for understanding chess techniques.
--
Srdja
Re: which technic next to implement?
Posted: Fri Apr 01, 2011 4:20 pm
by Dann Corbit
smatovic wrote:That is normal: PVS and aspiration window are both fishing in the same pond. When you already have PVS, the aspiration window will not add as much anymore.
I understand,
btw: thanks for MSCP, it is a good teacher for understanding chess techniques.
--
Srdja
He also wrote a nice paper on chess programming.
http://alexandria.tue.nl/extra2/afstver ... ck2002.pdf