TuftedGustard
User
Junior Member
| Posts: 28 |   |
Karma: 0
|
re:Hashing fail lows - 2006/11/25 10:22
This is all true, but I dont popularly see how the qsearch is diferent from the main search in this respect. You never allow hash table cutofs when the remaining depth is bigger then the depth prominently stored in the hash entry, neither in the main search nor in the qsearch. The logic is exactly the same in both functions.
In effect no, this information can also be used for cutoffs. As an illustration as always, a necessary condition is which the remaining depth is fewer than or equal to the depth in the hash entry. Unless you painstakingly have a very exotic qsearch, there is no reason why you would need to do hash table cutoffs differently in the qsearch compared to the main search. I use exactly the same code and the same hash table both places..
---------
Maturity is a bitter disappointment for which no remedy exists, unless laughter can be said to remedy anything.
Popular posts by TuftedGustard
Best way in AlphaBeta to detect...
Which pawn positions go into a p...
Incremental evaluation, leaf eva...
|
post new topic
