Your answer assumes that the lineman is distinguishable from the other positions, but that the other three positions are indistinguishable from each other. So, it solves the problem of choosing a lineman and three other players. But these three other players can choose their positions in $3!=6$ ways. Their answer is naturally based off of permutations and directly gets the correct answer.