Vijayan Ellappan*et al. /International Journal of Pharmacy & Technology IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 25618-25623 Page 25618 ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com COMPARATIVE ANALYSIS OF BACKTRACKING AND GENETIC ALGORITHM IN N QUEEN’S PROBLEM Anuneet Kumar Dubey 2 , Vijayan Ellappan 2 , Rakesh Paul 3 , Vishal Chopra 4 1234 School of Information Technology and Engineering(SITE), VIT University, Vellore, Tamil Nadu, India. Email: evijayan@vit.ac.in Received on 25-10-2016 Accepted on 02-11-2016 Abstract: This paper presents a comparative analysis of two algorithms i.e: backtracking and genetic algorithm for the solution of N queen‟s problem. In this paper the N queens problem is solved using both the algorithms . Both the algorithms have their own advantages and drawbacks. Bothatheamethodsaofasolvinga N Queen problem area entirely different. The first one is general method and takes time in days, months and years as a Na increases. Ina this paper the time taken by the two methods for as given value of Na area compared. Keywords: Backtracking, Genetic algorithm, N queens. I. Introduction: The following paper illustrates about the n queens problem along with the 2 algorithms which is compared for the solutions of the problem i.e backtracking and genetic algorithms. The use of the algorithms,benefits of one algorithm over another algorithm. In each algorithm we have provided better explanations along with definitions and pseudo codes. Various papers contents is explained in the literature survey and results is presented before conclusion. II. N Queens Problem: The problem states that we have to place N no of queens in a N X N matrix in such a way that no other two queens can capture each other . A queen can capture another queen if the other queen is in the same row,same column or diagonally with respect to the first queen. A German chess player named M Bezzel founded this problem in 1848.