We consider the following problem: Find the least integer $N(n)$ such that for arbitrary latin square $L$ of order $n$ we can choose $N(n)$ cells of that square such that after erasing the enteries occupying the remaining $n^2-N(n)$ cells the latin square $L$ can be reconstrusted uniquely. We discuss in detail the cases $n \leq 6$.