The post demonstrated a misapprehension, however. When a computer can "see" a tablebase position can be reached its evaluation is not small, it is a definite result. Before it can definitely reach such a position, it is the lines that do not reach tablebase positions that determine the evaluation, as they are the ones left from a minimax search.
Should the search be directed towards one of the known positions, or one of the known?
Well, if one side can force a win, that is the result. If not, then the evaluation assumes best play by both sides, so the best line (best play by both players) must be a position with some intermediate evaluation.
These lines of intermediate evaluation includes those where a player can force a draw. The simple way to deal with these is that a player who can do would do so unless they can force a higher evaluation than zero by a different choice of line. As a result, they don't complicate the situation much.
Note that search is recursive, so all positions where a player has an option to reach a winning tablebase position, they can be assumed to do so, and all positions where they can avoid a losing tablebase position, they can be assumed to do so.

It's hard for me to understand you (s23bog) sometimes. I wonder if there is maybe some language barrier or something?
I have the same problem, my suspicion is that it is more of a randomness barrier or something