Hi,

I also would like to know the following:

3. When a timeout occurs and you decide which move to play, do you use the best move from the previous iteration (the last completed one) or from the current iteration (which is always incomplete but may already have a "best move" as soon as searching the first move - the best from previous iteration - has been completed)?

4. Does it hurt to sort the whole move list at the root node based on their subtree values of iteration i to determine the order of moves for iteration i+1? The alternative way is only to search the best move of iteration i as first move in iteration i+1, while leaving all other moves in the same ("random") order.

Sven