Rakhya´s method: A case based approach to solve n-queens problem

The problem of n-queens (n = 8) is a classical search problem in the field of machine learning. Backtracking is frequently applied to solve such constraint based problems, but it often suffers from exponential growth of computing steps/time as n increases. This paper describes the Rakhya´s Method, which is an alternative approach to the method of backtracking. It is capable of finding more than one solutions for all values of n>3 in very few steps. There is a significant reduction in the number of steps, for instance, it takes 1,749,317,724 steps to achieve the first solution of 30-queens problem by backtracking whereas RAKHYA`s Method presents its first solution in 32 steps.