TalkChess.com

[H.G.Muller]

Good point. Normally root moves that fail low (because there already is a better move in that iteration) would not be printed. How is that different here? As long as there is no move, would you print a PV for every move that fails low? Or just the first? I suppose the whole idea of having an aspiration window is that when the PV move fails low, you will try all other moves first before enlarging the window and redoing the iteration?

I could alter the sorting algorithm such that a new PV could never pass a PV of the same iteration that starts with the same move. Would that solve it?