Timeline for When evaluating score of new position with UCI chess engine is the Hash used at all?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2016 at 21:00 | comment | added | Jeff Y | Yes, in other words, the hash table is not storing positions the user ever sees (mostly), it is storing all the millions of positions it sees in its forward search to calculate the value of the current position. And as you say, there are tons of repeats all throughout that search (transpositions, but also piece "tours" and backwards moves). If a position (and already-calculated value) is found in the hash table, it saves having to recalculate the value, which could be very significant for moves higher in the tree, where whole swaths of the tree can avoid being recalculated. | |
| Oct 23, 2015 at 2:57 | vote | accept | Lightbeard | ||
| Oct 22, 2015 at 23:54 | history | answered | SmallChess | CC BY-SA 3.0 |