In the problem above, what is the least number of moves for white to win if it is white's turn, and both players play optimally?
Note that white's pawns move upwards and black's pawns move downwards
Input 0 as your answer if you think it will be a draw or loss for white
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If you couldn't solve this by yourself, it is pretty simple: