At present, I assume they are listed randomly. But shouldn't it be possible for there to be an algorithm that computes the probability that a drawing move leads to a win through mistakes by the opponent? Simply take the number of paths that lead to a win and divide by the total number of paths after that move? I know that such numbers would be astronomical, but I'm sure there is some sort of recursion or inheritance method that would avoid having to deal with such big numbers. We must agree that in practical play, not all drawing moves are equal. After a drawn position, it may be very difficult for one side to maintain the draw, with the smallest of inaccuracies turning the draw position to a losing position. Often there is only one move out of many possible moves that will maintain the draw.

Would any programmer be interested in ranking the drawing moves based on these criteria? It could be an interesting experiment to play using it against an unassisted human, starting with a drawn endgame. The side with the tablebases can play the "best recommend drawing move" at all times, and see if the opponent, no matter how good an endgame player he is, crumble because the moves made leave him struggling more and more to maintain the draw.