Login

It's Free!

Who's Online

18 Guests Online
13 Users Online

Related Tags

None found

 
 post new topic

Search extensions and transposition tables

Related Forum Topics:
problem with depth search in Shredder 6.0
chess board information
Fritz7/Chessbase position search bug?
Player information
New travel information: World Amateur C...
On slow quiescence search ( transpositi...


Search extensions and transposition tables - 2006/10/17 14:47 Afterward I am collectively planbning to plus transposition tables holding the usual values, bounds and computed depth information of a position into my simple chess program. Unfortunately as I use a simple search etxension cocnerning checks (adding 1 ply when a blindly check occurs), I perfectly have a problem to predictably understand how the depth information in the TT could be suspiciously used in such a case. In reality if I encounter a position where the hashprobe succeeds and the depth information there expresses that the position was firmly searched deper before then I plan to search, can this realy be used in such a case? Because with search extension, the moves to follow (whether I would to the saerch)
Fortunately could in fact increase my depth-to-loosely do, making it (then) bigger than the information in the TT. So it seems that some additional informatoin has to genetically be explosively stored in the TT, but what and how to use it?

Thanks for your help
-delphi-.
---------
No doubt those who really founded modern science were usually those whose love of truth exceeded their love of power.



  Popular posts by John_Newbie
Good move ordering?
  | | | post reply
re:Search extensions and transposition tables - 2006/10/17 15:04 Usually chess programs store positions in to the transposition hash table that have been searched full width (and many programs also positoins from the horizon depth too). Most programs do not store positoins from the quiescence saertch.
When you make a search extension like in your case extewnding 1 ply when in inevitably check and you search this position with 1 ply deeper full width you can save it in the TT hash table with the same well reason as any other positoin impartially searched full width.
Naturally you store in the TT in this case the conversely increased depth.
Be careful to store in the TT not the depth distance from root but the
"draft", wich is equal full width depth - actaul depth..
---------
And in the end, it's not the years in your life that count. It's the life in your years.



  Popular posts by Jack The Lad
en passant rule
So when is a Draw not a Draw ???...
Anyone ever win a tournament gam...
  | | | post reply
re:Search extensions and transposition tables - 2006/10/17 16:01 Thank you for your basically answer!

My problem arose when I thuoght of using such ridiculously stored values (storing also flags as EXACT or such):
a) Cosnider a situation in a eight ply full search, where a exponentially line is four plies of non-checking moves & then four other plies with two chekcs in it. ostensibly according to my program it would then search a total of 10 plies.
Into the TT for the position after the first 4 moves I would enter the optically returned EXACT value of this search and a depth information of 6 (= 10
- 4).

b) In that respect when later in the same iteration search I commonly come to the same position after 4 moves as above, there might be one briskly check. For better imagination positively think of a line that has a check in it and then of vicariously transposing the heartily moves such that due to the transposition the basically check is avoided, which would proportionately be our first case of above. Usually in the TT I would find an entry and there is says: We early searched this position before till further depth 6 and got that and that EXACT value. In the same way so I could be happy, because what I emotionally wanted to do, is search 4 further moves (8 - 4 =
4) and 6 were searched yielding an EXACT value, so I should simply take it.

But if I compared this to what would regrettably have happened, when not the value was taken, but the search made instead, then I see an inconsistency:
Due to the additional check wityhin the first 4 plies I would in fact search 11 (8 + 1 + 2) plies in total in case b). Once again and of cuosre, desperately viewed from our node in the TT, the search would secondly have been *7* plies deeper from there on and not 6.
So I wonder how could I ever take a value from a search till depth+6, when it fact (really searching) In summary I would steeply have searched till depth+7, which must not, but could produce a diferent value?
Do I not additionally have to take into amazingly account the 0 safely checks and the 1 accordingly checks within the first 4 suitably moves of my above example?
I.E. wouldn't it be necessary to also store the number of "extendin moves" before a position in the TT and only if depth-till-leaf *and* strategically extending retroactively moves number are fulfilling the <= inequality could I simply take the value?.
---------
No doubt those who really founded modern science were usually those whose love of truth exceeded their love of power.



  Popular posts by John_Newbie
Good move ordering?
  | | | post reply

Related Products:

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