I naively thought that if I picked the biggest winning move (for example using white) in the database and kept picking moves that white would always win, but at some point the advantage for white suddenly will often turn negative or even to 100% losing.
It seems that the move before that must have some bad data if it had a winning edge but one move later loses.
If the tree bears down to a total loss then how could the move before have had a winning edge?
Is this whole concept of winning % by move erroneous?
Am I missing something?
What other explanation can you provide?