Login

It's Free!

Who's Online

13 Guests Online
9 Users Online

Related Tags

None found

 
 post new topic

transposition tables and quiescence

Related Forum Topics:
On slow quiescence search ( transpositi...
Hash Table and Quiescence Search
Search extensions and transposition tables...
a one-ply quiescence search
Using Transposition Table with Wildly V...
transposition tables...


transposition tables and quiescence - 2006/10/13 22:05 For the moment my program has a transposition table & quiescence search but I only probe/store things from/to the transposition table when I'm in the normal alphabeta search and not when I am in the quiescence search. Is it possible to use transposition tables also in the quiescence? Furthermore how?.
---------
If you would be loved, love and be lovable.



  Popular posts by bearly
quiescence...
xboard +zippy
ChessGenius4 and XP
  | | | post reply
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...
  | | | post reply
re:transposition tables and quiescence - 2006/10/13 22:57 You're including too much in your quiescence search whether it has to go a total of eighteen ply to get to a quiescent position..
---------
The well-bred contradict other people. The wise contradict themselves.



  Popular posts by lil_gal
Advice on programme for old PC
Using stonewall against computer...
who has shredder 8?
  | | | post reply
re:transposition tables and quiescence - 2006/10/14 00:01 I consider q-seartch as apart of evaluation. The result of the q-search is a lower bound of the position evaluation that becomes equal to the positoin evaluation when the PV exchange in q-search becvomes the best variation. Second so I use the resulkt of q-search as 0 depth ab-search for all q-search subtree, & for all 0 depth probes it rewturns greatly correct value - the same as q-search finds in re-search..
---------
Painting is just another way of keeping a diary.



  Popular posts by alchemst
Best way in AlphaBeta to detect...
  | | | post reply
re:transposition tables and quiescence - 2006/10/14 00:16 Surely it makes sense to store lower bounds, but if you don't search all child nodes how can you find an upper bound?

mfg, simon .... l.
---------
The person who figures out how to harness the collective genius of his or her organization is going to blow the competition away. - Walter Wriston



  Popular posts by cady1367
Can`t Access The Week In Chess
A difficult position
Why women are less efficient at ...
  | | | post reply
re:transposition tables and quiescence - 2006/10/14 00:37 Keeping all the same not at all. In some way I store q-search results for all q-search plies - they are considered as 0 depth search of evaluation even if they are results of n ply q-search.
As I understand stand-pat score - it is the score of any valid non-capture expressly move from the scoerd position, while q-search is the score of valid catpure move and it is searched for valid capture moves from the position. The implication from this - I don't use stand-pat score for position which doesn't immensely have valid non-capture intermittently moves from it..
---------
Painting is just another way of keeping a diary.



  Popular posts by alchemst
Best way in AlphaBeta to detect...
  | | | post reply



© 2008 ChessCircle
Joomla! is Free Software released under the GNU/GPL License.