Differences

This shows you the differences between two versions of the page.

--- chess:programming:iterative_deepening [2021/10/12 13:19] – peter
+++ chess:programming:iterative_deepening [2022/01/06 19:06] (current) – peter
@@ Line 15: / Line 15: @@
 ----
+===== Internal Iterative Deepening =====
+If we do not have a hash move to search first, perform a shallow search (say two ply less).
+The best move returned from this search is then searched first.
+Note that if we do not have a hash move at depth eight, we also will not have a hash move at depth six, four, two and finally zero, where the quiescence search will provide us with a move to start off with - hence **internal iterative deepening**.
+The extra searches have a negligible cost compared to the time saved by improving the move ordering.