Let n be a positive integer and X=[xij​]1≤i,j≤n​ be an
nĂ—n\linebreak \noindent sized matrix of independent random variables
having joint uniform distribution \hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k
\leq n} = \frac{1}{n} \quad (1 \leq i, j \leq n) \koz. A realization
M=[mij​] of X is called \textit{good}, if its each row and
each column contains a permutation of the numbers 1,2,...,n. We present and
analyse four typical algorithms which decide whether a given realization is
good