  Limited Discrepancy Search (LDS) is a popular algorithm to search a state
space with a heuristic to order the possible actions. Nested Search (NS) is
another algorithm to search a state space with the same heuristic. NS spends
more time on the move associated to the best heuristic playout while LDS spends
more time on the best heuristic move. They both use similar times for the same
level of search. We advocate in this paper that it is often better to follow
the best heuristic playout as in NS than to follow the heuristic as in LDS.
