hgm wrote:I don't understand this. Without LMR/LMP, history is just a move-ordering heuristic, not? So with or without it, you should get exactly the same moves, although the time it takes to fond them can be different.
I can think of a few reasons why I don't get exactly the same moves:
1. Hash table grafting. What you find in the hash table depends on what you have already searched.
2. Root moves are ordered by the size of the subtree used to search them.
3. If two moves have the same score, the search will prefer the first move it found.
4. Futility pruning is only applied when at least one legal move has already been searched.
There may be more reasons, but the above is enough to explain why I don't get exactly the same (but reordered) search tree with and without the history heuristic.