In this paper we have study simulated annealing algorithm for n-queen problem, the classical puzzle in mathematics. This classical combinatorial search problem has been used as a popular benchmark to explore the new Artificial Intelligence search strategies and algorithms. The n-queens problem is to place n queens on an n×n chessboard so that no two queens attack each other. This problem has found many practicals in scientific and engineering applications including VLSI routing, maximum full range communication. In this paper, we present the solution from simulated annealing algorithm(SA)which is probabilistic method. Investigating an acceptance ratio and stochastic nature of solution from this problem is presented.
