At least in game programming (combined with e.g. alpha_beta_search), iterative deepening relies on the fact that the search algorithm used, uses a transposition table. Thus, the repeated evaluation of nodes is partly amortized. As soon as one tries to implement such a scheme, the question arises, how the strategies for updating and using the transposition table (which fills up with each deepening of iterative deepening loop) might look like. I have yet to find a lecture which explains that crucial point.
The previous video as well as this one are absolutely brilliant. Thank you!
At least in game programming (combined with e.g. alpha_beta_search), iterative deepening relies on the fact that the search algorithm used, uses a transposition table. Thus, the repeated evaluation of nodes is partly amortized. As soon as one tries to implement such a scheme, the question arises, how the strategies for updating and using the transposition table (which fills up with each deepening of iterative deepening loop) might look like. I have yet to find a lecture which explains that crucial point.
im happy about there is a ppl like you who tries to help other
This is exactly what i was looking for... :)
Great video - thanks for this!
I know this is a long time after posting but in dbSsearch should the recursive call be
dbsearch(n0...NK-1,n) rather than dbsearch(n0...NK,n) ????
Alan
Great Video THANK YOU!
Thanx man you saved my day
thank you so much :p
Nice :D