Given a board size (numRows, numCols) and a starting position (startRow, startCol), determine if the knight can visit every cell exactly once.

The knight moves in L-shape: 2 steps in one direction and 1 step perpendicular.