Originally posted by SwissGambitWhat are 'N moves' are they different to ordinary moves?
[fen]2bRRK1k/1p1pp1pP/3p2p1/P6P/8/5P2/1P1P1PP1/8[/fen]
What is the minimum number of N moves required to legally reach this position?
And I also came up with 5. ... But I guess I'm starting from a different position than you envisaged!
Originally posted by wolfgang59Superficial analysis leads to superficial results.
White has to make 6 pawn captures. Conceivably thats 2 pawns, 2 rooks, Queen & Bishop. Blacks knights dont need to move.
Black only has to make 5 pawn captures and again no need for white\'s knights to move.
So I guess answer is zero.
Sorry, thanks for playing, better luck next time.
Originally posted by wolfgang59Yeah. Your schedule's already booked for solving the math problems on here.
it was an educated guess - I dont have time to waste on these things
But no worries. I post these kind of problems occasionally to see if there are any others who enjoy them. If that's not you, don't sweat it.
Edit: Hey! Aren't you the guy who said, "The whole point of a mathematical proof is its VIGOUR!" Same applies to retros!