A Knight Problem
A knight standing on a center square (e4, e5, d4, d5) has eight different squares it can move to in one move. How many can it reach on the second move?
A knight standing on a center square (e4, e5, d4, d5) has eight different squares it can move to in one move. How many can it reach on the second move?
