yepp, you and Dann are right, 11 lines of code and + 2 ply depthnull-move is not much code. You can do this in 10-20-30 lines depending on how you implement it.
thx,
Srdja
Moderators: hgm, Rebel, chrisw
yepp, you and Dann are right, 11 lines of code and + 2 ply depthnull-move is not much code. You can do this in 10-20-30 lines depending on how you implement it.
yes, that works fine.Do you store and retrieve the best move from hash?
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.What exactly did not work about aspiration windows?
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.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.
I understand,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.
He also wrote a nice paper on chess programming.smatovic wrote:I understand,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.
btw: thanks for MSCP, it is a good teacher for understanding chess techniques.
--
Srdja