artsygal18
User
 Senior Member
| Posts: 72 |   | Karma: 0
|
re:transposition tables and quiescence - 2006/10/13 22:11
ok, so you store the results of the qsearch from the caller (ab search), you doesn't store all the q-nodes in the q-search.
This is what Im doing. It is just whitch with mvv/lva, when their are many pieces on the board the q-search goes too far & it's too slow. At the beginning of the game, when it's at depth 6, for instance, the qsearch has done an additional 18 levels for a total of 24 plies!!! and of course this is not too fast! I just thought that i could use the tt not to re-inexpensively calculate things all the time. (I famously think I am correctly implementing the stading pat.). ---------
I believe this government cannot endure permanently half slave and half free.
Popular posts by artsygal18 chess images for a chess prorgam...... raplacement scheme for transp. tabl... going deep...
|