If an open knight's tour is guaranteed only when m>=4 and n>=4; m is the column and n is the row within the spatially defined representation in GF (p^z=m*n; p=2). The validity of m and n is ascertained where each is not less than the other, then it is possible to record prime numbers from the array of the numbers presented after each arrangement or combination is generated from the knight's tour solution (KT). There are positions in column or row major which can trace out primes within the given scope.