<s>[INST] An infinite chessboard has an infinite number of unit squares. Given a set of knight moves (two squares in one direction and then one square in a perpendicular direction), what percentage of all two-square move paths can be covered by a knight on the chessboard?[/INST]