Let the number of ways for a rook to return to its original square on a 4 × 4 chessboard in 8 moves if it starts on a corner be k. Find the number of positive integers that are divisors of k. Note: a "move" counts as shifting the rook by a positive number of squares on the board along a row or column.
